3. [20 points] For the following code fragment compute the worst-case asymptotic time complexity (as a function of n). Briefly and I mean briefly, explain how you obtained your answer. BTW asymptotic time complexity is a fancy way of referring to Big-0 Amaze your friends. This means find T(n) and then figure out O(n). Hint: Write a nested summation to express the number of times the loop body is executed. for (i=0; i