2. (25 pts) Professor Dumbledore needs your help. He gives you an array A consisting of n integers A1], A[2],... , A[n] and asks you to output a two-dimensional n x n array B in which Bli, (for i j) contains the sum of array elements A[i] through A[j. ie., the sum Ali] Ait 1] + + A (The value of array element Bli,j] is left unspecified whenever i 2 j, so it doesn't matter what the output is for these values.) Dumbledore suggests the following simple algorithm to solve this problem: dumbledoreSolve(A) 1 for i-1 to n for j = i+1 to n through A[j] s = sum of array elements A[i] B[i,j] = s end end