Write down the recursive function which takes list head pointer as parameter and returns largest value in linked list. Recall that xy = (xy/2)2 if y is even. Use this to write function which calculates xy, suppose that y is a power of 2. Use principle of divide-and-conquer to do the minimum number of multiplications. Write down the function to calculate the following recurrence using dynamic programming. PN = PN-1 + 2PN-2, with P1 = P0 = 1.