For each of the following code fragments, estimate an upper bound on the worst case running time of the code fragment using O0 notation. Give your answer in terms of n Briefly explain your answer. 1. What is the running time of the following code fragment? t=n; while t> 1) 1 t=t/2; Running Time = Explanation