Write a Linked List method reverse() which reverses the order of the elements in the List. No List Nodes should be created or destroyed in the process. Rewrite the Linked Stack class from scratch so...

Write a Linked List method reverse() which reverses the order of the elements in the List. No List Nodes should be created or destroyed in the process.

Rewrite the Linked Stack class from scratch so that it holds primitive ints. The List Node class must also be altered. (This revised Linked Stack is more efficient than the general purpose one, because it doesn’t have to follow references or create instances of the Integer class.)