1. (15 points) Compute the running time of the following algorithm and establish the order o growth. Use the (g(n)) notation with the simplest function g(n) possible. Algorithm Sum(); Result := 0; for i:= 0 to n+1 do for j :- 2 to i do for k:- 3 to 1-1 do Result ++ Output Result: 2. (20 points) Compute the following sums and find the order of growth of the sums. Use the e96)) notation with the simplest function g(n) possible. (a) 2i(i+1) (5) " (1 +1) Hint: 12 + 2 + ... + m2 = n(n+1)(2+1)