Part I 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. Work must be shown to receive full credit. Reminder: what is "pseudocode"? It is a way of expressing algorithms that describes at a high level what they do but omits details specific to any particular language (Java, C, Python, etc.). You'll find lots of pseudocode in your textbook. If you have any question about what the code blocks below mean, please ask. The main thing that may be new to you in pseudocode is the use of to indicate assignment: " 1" would be written in Java as "j = 1;". Pseudocode uses because it often uses "=" to mean equality testing (where Java would use ==). 1. for j in 1 ... n do for k in 0 ... j +5 do TICK 2. ito while ii do TICK TICK -- i++ 3. TICK it1 while i<><>