1. Find Sp (n) of following algorithm. AlgoSum (a, n) { int i; int s = 0; for (i = 1 to n). s += a[i]; return s; } Sp (n) = ? { 2. Find the space complexity of following algorithm. AlgoSum (A, 1, n) create B [n] [n]; int i, j; for (i = 1 to n) } Sp (n) = ? for (j=1 to n) B[i] [j] = A[i];