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 and n Output:? 1: function BAR(a, n) 2: k<>