For each algorithm, compute the exact number of times the algorithm prints in terms of n and compute the runtime in terms of , where n 3

(a) (b) for i=1 to n: for j =1 to i: print (1,3). for i=1 to n: for j = 1 to [1/2]: print (i,j). for i=1 to n: for j=1 to n - 1: for k=j +1 to n: print (i, j, k) c (c)