Answers in JAVA please

8. The following is an example of a circular array queue data structure: 0 size - 1 III b c d e III 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): insert a new char elements into the back of the queue. isEmpty(); returns true or false if the queue is empty Include your Java code. b c d e IN 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). 10. The following is a snippet of code. What is the worst case runtime in O(n)? b = b + 5 c = b / a b = c + 100 for (i = 0; i