14) Order Estimation, Again Homework Unanswered Given the following algorithm fragment: RANGE K FROM S TO e BY 1 a[k] = b[k-s] + c[k-s]*d[k-s] INVOKE decompose PASSING a[k] RECEIVING a [k] END RANGE And knowing that the decompose algorithm is O(n), estimate the complexity order of the given fragment. 16) Recursive Printing Homework Unanswered Write a recursive function to print all elements of a singly-linked list given the lists's head as your single argument. What would need to change in your function to have it print the elements of the list backwards