1. Define each of the following: Algorithm Problem types are: Algorithm Approaches 2. Time efficiency of non-recursive (iterative) algorithms 3. Useful summation formulas and rules a. Elsisn5 = 5+5+...+5 = b. Eisisn i = 1+2+...+n = c. Eosisn d' = 1+ a +...+ ah = In particular, Eosisn 2i = 2 + 27 +...+ 2" = 4. For each of the following sections of programs find the complexity T(n) 4. For each of the following sections of programs find the complexity T(n) a. for i = 1 to n 1 do if A[i]> maxval maxval + A[i] return maxval b. for i = 0 ton 2 do for j = i +1 to n - 1 do if A[i]= A[j] return false return true T(n) =