Define a queue. What are the three interfaces we defined related to our Queue ADT? Complete the implementation of the isFull method: public boolean isFull() // Returns true if this queue is full, otherwise returns false. { // complete the method body } Complete the implementation of the enqueue method: public void enqueue(T element) // Throws QueueOverflowException if this queue is full. // otherwise adds element to the rear of this queue { // complete the method body } Complete the implementation of the dequeue method: public: T dequeue() // Throws QueueUnderflowException if this queue is empty // otherwise removes front element from this queue and returns it. { // complete the method body } Define a list. What are the three varieties of lists defined in the textbook? What operations are required by our IndexedListInterface but not by our Listlnterface? (at least 3 to get full grade) Describe the functionality of the list contains method