As you begin to look at data structures using Java, this first assignment will have you look at the implementation of a queue and a

As you begin to look at data structures using Java, this first assignment will have you look at the implementation of a queue and a stack. These two algorithms will be implemented using linked lists. You will complete 2 given program shells: one for a queue and the other for a stack. In addition, you will establish your Key Assignment template that you will build in Week 1, and each week, you will add material to the appropriate section of the document. Your Data Structures Using Java template document should be in the following format: Each week, you will add to this document and submit for grading. As a preview, each section will contain the following: The task this week is to complete the following 2 structures using a linked list: Assume the occurrence of a linked list node is represented by the object “Node” and its “Data” and “NextRef” attributes. : Assume a “Head” node exists with the NextRef attribute pointing to the first node in the stack or being null if the stack is empty. Create pseudo code for the following 3 stack methods, showing the logic tied to the inverted list. Include a summary of these actions. Assume “Front” and “Rear” nodes exist with the “NextRef” attributes pointing to the first and last nodes of the queue or being null if the queue is empty. Create pseudo code for the following 3 queue methods, showing the logic tied to the inverted list. Include a summary of these actions.