H ALL 1 2 3 2. Simple Matrix Summation Given an n x m matrix, a, where each a(i, j) is the value of the cell at the intersection of row i and column j, create another n x m matrix, b, using the following algorithm to set the values of each b(x, y) with zero-based indexing: s = 0; for (i = 0; i < x; i += 1) { for (j = 0; j < y; j += 1) { S = s + a(i, j); } b(x, y) = s; Note that the algorithm sets just one b(x, y) per execution and that 0