Please write in java, thanks

Linked List Queue Introduction A queue is an ADT that represents an ordered, First-In-First-Out (FIFO) collection. An ordered collection maintains the insertion order of the elements. New elements can only be added to the back of the queue. Existing elements can only be removed from the front of the queue. . . A queue can be used in real-world modeling, such as keeping track of service requests so that they are handled in the order they arrived. It can also be used internally in computer functions, such as storing printer requests in a print queue The basic methods for a queue are as follows: . enqueue(value)- adds the value to the back of the queue. dequeue)- removes the next available value from the front of the queue and reports the value. isEmpty()-reports if the queue is empty. Other convenience methods are usually added: . front)-returns the value at the front of the queue without removing it. size()-returns the number of values currently stored in the queue. Java's Linked List and ArrayDeque concrete classes implement the queue ADT, but they also include many other methods that do not prevent the access to data that should not be accessible in a pure queue implementation