Problem
1. Implement the method enqueue for a LinkedQueue. The method adds an entry to the back of a queue.
2. Write Java statements to display the entries in a stack. Assume that the ADT stack is implemented by the LinkedStack.
3. In a doubly linked chain, each node can reference the previous node as well as the next node.
4. Define a class to represent a node in a doubly linked chain.
5. Write a test program to add the following items to the doubly linked chain: Apple, Orange, Pear, and Mango. The test program must also display the items in the doubly linked chain.