IN JAVA: Write a reference-based implementation of a queue that uses a linear linked list to represent the items in a queue. You will need both a head reference and a tail reference. Be sure that the project includes all of the following:

A Node class. Your queue ADT will need this class in order to instantiate the Node objects which make up the linear linked list.

A Queue ADT This is a class which contains global, private head and tail reference variables as well as the Queues wall of operations. This wall of operations are the methods which are responsible for creating and managing the ADTs Linked List which. Queue ADT will use this Linked List to represent the queue.

A Test class. This class will contain a main method which instantiates an object from your Queue ADT class and invokes every Queue ADT method. What are some ways you can invoke the Queue ADT methods to demonstrate that those methods work in the way that they are intended to?