5. (10 points) Find the tight bound the worstcase runtime of the following algorithm. Clearly explain on your reasoning and calculations but you do not have to be excessively formal. (equivalent versions left is C-style code, right is pseudocode) 1: for i = 0; i 0; k = |k/2] do 3: one for k = n down to 0 by k = |k/2] do do something that requires (Vn log n) 4: do something that requires On logn) 5: end for 5: end for 6: end for 6:0 end for 7: end for 7: end for