Using Python, Java, Or C++, Please do as the question says and follow the instructions. Thank you.

the queue class:

import java.lang.reflect.Array;

public class Queue implements QueueADT{

private int size, front, rear;

private E data[];

public Queue(Class element,int size){

//ToDo

}

public boolean isEmpty(){

//ToDo

}

private boolean full(){

//ToDo

}

public void enqueue(E x){

//ToDo

}

public E dequeue(){

//ToDo

}

}

--------------------------------------------------

testing:

Queue Q = new Queue(Integer.class,9);

System.out.println(Q.isEmpty());

for(int i=1; i

Q.enqueue(i);

if(i%3==0)

Q.dequeue();

}

while(!Q.isEmpty()){

System.out.println(Q.dequeue());

}

------------------------------------------------------

Reverse a queue How to reverse the content of a queue using a stack:

Queue Q = new Queue(Integer.class,9);

Stack S = new Stack();

for(int i=1; i

Q.enqueue(i);

}

//Reversing the queue

//ToDo

How do we implement a circular array Create an array of size 10 and fill it with numbers from 1 to 10 insert values in the array T from 1 to 3214 in a circular way begir what is the content of the array T ? Queue based Array implementation Queue based Array implementation 1. The abstract data type Queue 2. The Queue class import java.lang.reflect.Array; public class Queue implements QueueADT \langle private int size, front, rear; private E data[]; public Queue(Class element, int size)\{ // ToDo \} public boolean isEmpty()\{ //ToDo private boolean full()\{ ///ToDo 3. Testing QueueQ= new Queue >( Integer.class, 9); System. out.println(Q.isEmpty ()); for(int i=1;iQ= new Queue > (Integer. class, 9); Stack Integer >S= new Stack >(); for(int i=1;i