Q1 [5 pts] What does the following Algorithm fragment do when n is 32? Trace the program and show your work to get full credit int funl (int n) { } if (n==1) else return 0; return 1 +fun1(n/2); Q2 [5 pts] What does the following code fragment prints if a linked list is 1 2 3 4 56 Trace the program and show your work to get full credit def funl (head): if (head == None) : return funl (head.next) print (head.data, end "1 = ") Q3 [5 pts] Given a non-negative int n, write and test a recursive python function sumDigit that returns the sum of its digits recursively do not use iterations. What is the time complexity for your algorithm?