Define an ADT to support the operations enqueue, dequeue and onqueue. onqueue(x) is a function returning true or false depending on whether x is on the queue. Write also onqueue and compute its running time. Extend the ADT queue to include the following operations: last that will return the rear element of the queue (which shall not be deleted from the queue) length that will return the number of elements on the queue. enqueueN that will enqueue an array of N elements on the queue dequeueN that will dequeue and return an array of N elements from the queue Write an implementation for each operation and compute their running time. Extend the ADT queue to include an operation called searchqueue that searches for an item on the queue and returns its position. Write a program for the new function and compute its running time. Implement the ADT that provides a circular implementation of a queue. Extend the queue ADT to include a function that returns the number of elements on the queue. Implement such a function. A dequeue (doubled-ended queue) is a list from which elements can be inserted or deleted at either end. Present a specification for the dequeue ADT and develop array as well as pointer implementations of it