2 [10 marks] Worst-case and best-case algorithm analysis. Consider the following function, which takes in a list of integers i def myprogram(L: List[int]) > None: n = len (L) x=1 while i > 0: 6 i-// 2 # integer diti sion, rounds down x+= 1 , else: 10 Let WC(n) and BC(n) be the worst-case and best-case runtime functions of myprogram, respectively, where n represents the length of the input list L. You may take the runtime of myprogram on a given list L to be equal to the number of executions of the while loop (a) 3 marks] Prove that WC(n) E O(n)