JAVA please

How do we implement a circular array

Create an array of size 10 and fill it with numbers from 1 to 10

//ToDo

insert values in the array T from 1 to 3214 in a circular way beginning from index 0.

//ToDo

what is the content of the array T ?

//ToDo

Queue based Array implementation 1. The abstract data type Queue

//ToDo

2. 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

} }

3. Testing

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

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

for(int i=1; i<9; i++)

{ Q.enqueue(i);

if(i%3==0)

Q.dequeue();

}

while(!Q.isEmpty())

{

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

}

The output should be:

//ToDo

4. 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<=9; i++){ Q.enqueue(i);

}

//Reversing the queue

//ToDo