Question 13 10 pts The following algorithm adds all the entries in the upper triangular" part of a square nx n array A. Consider n = 5 and the 5 * 5 array below. The work unit is the addition operation, sum = sum + A[k, j]. How many times is the sum = sum + A[k,j] operation done? 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 02 3 1 2 22 3 0 1 O 15 O 25 O 10 5