Please help me with the following questions: (Please write out all the solutions step-by-step and justify your answers)

2. (15 points) For each algorithm, compute the exact number of times the algorithm prints in terms of n and compute the runtime in terms of . (a) (b) (c) for i = 1 to n: for j = 1 to i: print (i,). for i = 1 to n: for j=i+1 to 2n: print (i, j). for i=1 to n: for j = 1 to [(i+1)/2]: print (i, j). for i = 3 to n: for j = 2 to i - 1: for k=1 to j -1: print (i,j,k) for i = 1 to n: j=n while ; > 0: print (i, j) j = 1/2 (d) (e) 2. (15 points) For each algorithm, compute the exact number of times the algorithm prints in terms of n and compute the runtime in terms of . (a) (b) (c) for i = 1 to n: for j = 1 to i: print (i,). for i = 1 to n: for j=i+1 to 2n: print (i, j). for i=1 to n: for j = 1 to [(i+1)/2]: print (i, j). for i = 3 to n: for j = 2 to i - 1: for k=1 to j -1: print (i,j,k) for i = 1 to n: j=n while ; > 0: print (i, j) j = 1/2 (d) (e)