Maximum Path in a grid

Chef wants to go to his home and there is a grid on the way. (The grid is a Square Matrix of size $n$ ). And chef is Currently at the UpperLeftmost point (i.e. at 0,0) and his home is at the lower rightmost point (i.e. at n,n). he is Restricted to move only either Right or Bottom. Given the traveling Cost of each cell (means chef has to pay that amount to go from that cell) of the grid, th