Recursion from basic : Programming for beginners

I will upload maximum path sum in next video:
hint:
base case of maximum path :
if(i==0 || j==0) return ar[i][j];
return max(maxpathsum(ar,i-1,j),maxpathsum(ar,i,j-1))+ar[i][j];
-----------------------------------------------------------------------------------------------------------------

This is the sheet 7 which is based on recursion:

-------------------------------------------------------------------------------------------------------------