6) Given a singly LinkedList, one can reverse the list using a Stack. Write a detail pseudo-code OR Java code (Yes, on paper) to accomplish this reversal. The final outcome is a new LinkedList (you must preserve the original list). Assume the LinkedList contains following constructors and methods: LinkedListO. Element get(index), int size0, void addLast(element). Assume the Stack contains following constructors and methods: StackO, void push(element), Element popO. Element peek0. bool isEmpty0. (15 points)