Suppose that you have a singly-linked list L containing the sequence of numbers (1,2,3,4,5,6,7,8,9). Suppose further that you have an initially empty stack S.
i) Give a pseudo-code description of a method that uses only L and S to reverse the sequence in L. That is, after calling the method, L will contain the sequence (9,8,7,6,5,4,3,2,1). [10 marks]
ii) Provide an analysis of the worst-case run-time complexity of your method.