(10 points) Describe in a few words what the algorithm Foo does and what the algorithm Bar does. Analyze the worst-case running time of each algorithm and express it using "Big-Oh" notation Input: two integers, a and n Output: ? Input: two integers, a Output:? and n 1: function Foo(a, n) 2: 1: function BAr(a, n) 2: 3 4: 5: hile > 0 do 6 4 while k n do 5: 6: 7 return b C a kk+1 if k mod 2-0 then kk/2 else 9: 10: 12 return b