1. Propose an implementation of the CircularQueue class that implements the Queue interface. 2. If the circular queue is full, the program should resize the array size by creating an array of twice the capacity of the initial array capacity. The program must copy the elements of the old array into the new array. public interface Queue E>{ void enqueue (E elem); E dequeue (); boolean isEmpty ();.

1. 1. Propose an implementation of the CircularQueue class that implements the Queue interface.
2. If the circular queue is full, the program should resize the array size by creating an array of
twice the capacity of the initial array capacity. The program must copy the elements of the old
array into the new array. public interface Queue E>{ void enqueue (E elem); E dequeue ();
boolean isEmpty ();