Answer based on Algorithm Analysis over linked lists and arrays.

a. Describe an efficient algorithm to find the middle of the linked list?

b. Find n^th node from the end of a single linked list. (in one pass)

c. Write an O(n) algorithm to print the next larger element for every element in the array with n distinct elements. The next larger element for an element x is the first larger element on the right side of x in array. Elements for which no larger element exist, consider next larger element as 1. For array [4,15,2,9,20,21,13] the output will be 15,20,9,20,21,-1,-1.