Consider the following recursive method. public int foo(int a, int b) { if (a%b = 0) return b: else return foo(b, a%b): a. What is the output given by foo(17, 3)? b. Explain briefly the purpose of the foo function. (example: it is finding the max of x and y). Following is C like pseudo code of a function that takes a number as an argument, and uses a stack S to do processing. void fun(int n) { Stack S;//Say it creates an empty stack S while (n > 0) { //This line pushes the value of n%2 to stack S push(&S, n%2): n = n/2: } //Run while Stack S is not empty while (!isEmpty(&S)) printf("%d ", pop(&S));//pop an element from S and print it } What does the above function do in general