A) N is positive value We have N*N dimension matrix In this matrix we have values(Positive or negatives) For example N=4

Starting position is 1x1.We can go one right or one down.Ending position is NxN.How can we make much money(postive values earn negative values lost money) for this matrix(Code for Sample and all kind of matrix) Answer this question with Dynamic Programming Method Algorithm

B)Can we solve this problem with Greed Algorithm? If yes please explain.

C)Write pseudocode for your algorithm

Please use keyboard for codes

8 -10 30 14 4 2 18 -4 -16 - 12 8 40 -12 4