Compute the exact number of times that the statement tick is executed in the following pseudocode fragments, as a function of n. Show your work, including for each loop the minimum and maximum value of the loop counter, as a function of n and/or the next outermost counter. Give your answer in closed form, with no remaining summations. --> USE SUMMATIONS TO PROVE THE NUMBER OF TIMES THE TICK IS EXECUTED

while i i do TICK<>