In this section we will build our own queue data structure, using Nodes, utilizing the concept of linked Nodes as a data structure. When implemented successfully, this data structure will provide you the functionality of a queue and should produce the same result as the built$-$in java Queue. You will also get to implement the Node class above as a private inner class in your code.

Follow the instructions embedded in the file and fully implement methods that are incomplete.

Compile and run your software with the provided driver in the same file.

Test your queue$-$are the outputted elements in the order that the elements are pushed?

Compare your output with output observed when using Java$$s built$-$in Queue. $$

Explain in a comment specifically which method is responsible for making sure that FIFO behavior $($a characteristic of Queue$)$ is correctly implemented in your software.