Answer in java, thank you.

**Let me know if you need any references from the textbook to solve, thank you!

5. Assume you have implemented ADT LinkedStack where, instead of the first element being top of stack, the top of your LinkedStack implementation is the last node in the chain of nodes. Given that, write pseudo code for the following methods, that do not have to do traversing (20 points] (a) push (b) pop (c) peek