in java

8. The following is an example of a circular array queue data structure: Q: 0 s ize - 1 Dede front back The queue implementation has the following instance variables: - char array - holds the items - int front, back - shows the front and back of the circular array queue. Implement in Java the following operations: enqueue(char x): inserts a new char elements into the back of the queue. isEmpty0: returns true or false if the queue is empty Include your Java code. b c d e HIN front back The above is a linked list implementation of a queue. In a linked list implementation of a queue, how do you check if the queue is empty? What is the basic idea of enqueuing a new item into the list? (ie. Describe how you would implement enqueue)