Q1.) For the below code, show all recursive calls and corresponding print contents from the following function when the initial call is newDisplay(37, 3). What is this function computing?

void f(int n, int k){

if (n>0){

if ((n/k) > 0)

f(n/k, k);

System.out.println(n%k);

}}

Q2.) Compare arrays and linked lists, stating one advantage for each vs the other:

Q3.) Correct any bugs in the following algorithim for printing out the items containes in the nodes of a circular, singly linked list with a head pointer:

printLinkedList(head){

current = head

while (current != head){

print(current.getItem());

current = current.getNext()

}