Exercise E.22. Given an nxn matrix Ali,j) of integers, give an efficient dynamic- programming algorithm to compute the maximum value A(c,d) - A(a,b) over all choices of indexes such that both c> a and d > b. Exercise E.22. Given an nxn matrix Ali,j) of integers, give an efficient dynamic- programming algorithm to compute the maximum value A(c,d) - A(a,b) over all choices of indexes such that both c> a and d > b