Question 3: (a) Write a recursive function that calculates x" using repeated squaring i.e., where x2n+1 =x * x2n andy?n= xn *-x" = (x*x)n) (4 marks) Q.5 sp elic no uare j- (b) Rewrite the length() function below to make it tail-recursive. The function takes a linked list as parameter and returns the number of nodes. (2 marks) 2. struct Node Type int info; NodeType* next; \; int length( NodeType* list) if ( list == NULL ) return 0; else return 1+ length( list->next )