solve all the three questions below with right answer

1. Using an array as the underlying data structure for an ADT without including an enlarge method is considered a bounded implementation and can result in a full ADT. Which of the following operations listed below should not be attempted on a full ADT? Check all that apply.

queue.dequeue

stack.push

stack.peek

stack.pop

queue.enqueue

2.

Given a queue populated with an unknown number of elements, along with an empty stack object, develop an algorithm in Java-like pseudocode that removes all of the items from the queue and puts them back in the queue in reverse of their original order.

The only stack and queue operations available to you are the ones specified in StackInterface.java and QueueInterface.java, the interfaces provided for Programming Project #2, that we also used for class exercises.

Please use myQ as the name of the queue, and myStack for the name of the stack.

3.

Which of the items listed below are considered to be defining characteristics of an abstract data type? Check all that apply.

A set of values

A set of operations that can be peformed on the ADT's values

A specific representation in memory