0
/ 2.0
Use this interface definition to solve this problem.
public interface QueueADT<E> { /* Set the queue to its initial state. */...Use this interface definition to solve this problem.
public interface QueueADT<E> {
  /* Set the queue to its initial state. */
  public void clear();
  /* Add an element to the queue (on rear). */
  public boolean enqueue(E it);
  /* Remove the element from front of the queue and
     return it. */
  public E dequeue();
  /* Returns the element from front of the queue without
   * removing it. */
  public E frontValue();
  /* Return the number of elements in the queue. */
  public int numElements();
  /* Is the queue empty? */
  public boolean isEmpty();
}
Write a method to remove the first two elements and
add three new elements to a queue.
You should check that queue is not
null and it has more than 2 elements. Add the following
three elements, in this order: "A", "B" and "C".
Make sure you use the interface from above.
Your feedback will appear here when you check your answer.