Question

You will be given a square matrix of N rows and N columns (1 == N<= 1000) containing positive and negative integers with absolute valunot larger than 1000. You are required to compute the greatest sum achievable by walking a path, starting at any cell of the matrix andalways moving downwards or rightwards. Additionally, you have to report the number of times that value is achievable. N will be in the firline of the input. N lines follow with N integers each. You should output a single line with two integers separated by a single blank space:first one is the greatest sum, second one is the number of times this value can be reached.Case 1:For the input provided as follows:31-211-6 -1 4-14111112222211111Output of the program will be151​

Answer 1

Answer:

follow me so I will give you answer for you question