Question 23: a: for i = 1 to n sum = 0 j = i while (j <= n) { sum = sum + A[j] j++ } print sum } Assuming n = 4 and A is a list starting at index 1 and containing {1,1,1,1}, what will be printed? What is the expression T(n) for the time complexity (or the number of additions performed) as a function of n? Give T(n) in notation, in its simplest form. b: while i <= n { for j = 1 to n sum = sum + A[j] for j = 1 to n prod = prod * A[j] print sum print prod i = i + 4 } What is the expression T(n) for the time complexity as a function of n? (careful what the i=i+4 does!) Give T(n) in notation in its simplest form.