Question 12 5 pts The following algorithm adds all the entries in the "upper triangular" part of a square n x n array A. Consider n = 5 and the 5 * 5 array below. What will the ending value for sum be for this algorithm and the array below? sum = 0 for k = 1 to n do for j = k to n do sum = sum + A[k,j] end for end for 1 3 1 0 2 3 1 0 3 3 0 0 1 2 0 0 2 3 1 2 2 2 3 0 1 0 21 O 36 O 15 16