Time Complexity - Practice Questions draw the table with these columns: iteration, value of i, values of k, iterations count for k, values of t, iteration count for t, total repetitions due to k fork and for t loops for one i write the summation, write the closed form solution where required. (Note that the 3 summations in the cheat sheet - are provided with their closed form. E.g. for 1+2+3+.(n)+n also written as t, has ! closed form: "(n+1) dominant term (if you could find a closed form for the summation) write (Theta) (if you can) a) Closed form, dominant term and NOT required. 01. a) for (1-1; 1