more efficient queue representation is obtained by regarding the array of elements of queue to be queue could be implemented using reverse polish notation is also called is used in time-sharing multi-user systems where programs of high priority are processed first amid programs with the same priority form standard queue queue exhibits the property queue could be implemented using and is collection of elements such that each element has been assigned priority notes review questions write segment of code to create copy of given queue let be the given queue and be the copy all the elements of must be equal to do not assume any implementation of queue describe the application of queue how will you insert and delete an element in queue write program to implement double-ended queuewhich is queue in which insertions and deletions may be performed at either end use linked representation write the following methods for linked queues(athe method empty(bthe method retrieve(cthe destructor(dthe copy constructor(ethe overloaded assignment operator assemble specification and method filescalled queue and queue cfor linked queuessuitable for use by an application program for linked extended_queuethe function size requires loop that moves through the entire queue to count the entriessince the number of entries in the queue is not kept as separate member in the class consider modifying the declaration of linked extended_ queue to add count data member to the class what changes will need to be made to all the other methods of the classdiscuss the advantages and disadvantages of this modification compared to the original implementation write an implementation of the extended_queue method full in light of the simplicity of this method in the linked implementationwhy is it still important to include it in the linked class extended_queue give formal definition of the term dequeusing the definitions given for stack and queue as models recall that entries may be added to or deleted from either end of dequebut nowhere except at its ends give two reasons why dynamic memory allocation is valuable lovely professional university