data structures using write program to implement priority queue write program to create queue from stack write program to create stack from queue write program to reverse the elements of queue write program to input two queues and compare their contents multiple-choice questions line in grocery store represents (astack (bqueue (clinked list (darray in queueinsertion is done at (arear (bfront (cback (dtop the function that deletes values from queue is called (aenqueue (bdequeue (cpop (dpeek typical time requirement for operations on queues is (ao( (bo( (co(log (do( the circular queue will be full only when (afront max - and rear max - (bfront and rear max - (cfront max - and rear (dfront and rear true or false queue stores elements in manner such that the first element is at the beginning of the list and the last element is at the end of the list elements in priority queue are processed sequentially in linked queuea maximum of elements can be added conceptually linked queue is same as that of linear queue the size of linked queue cannot change during run time in priority queuetwo elements with the same priority are processed on fcfs basis output-restricted deque allows deletions to be done only at one end of the dequeuewhile insertions can be done at both the ends if front=max and rear then the circular queue is full fill in the blanks new nodes are added at of the queue allows insertion of elements at either ends but not in the middle the typical time requirement for operations in linked queue is in insertions can be done only at one endwhile deletions can be done from both the ends dequeue is implemented using are appropriate data structures to process batch computer programs submitted to the computer centre are appropriate data structures to process list of employees having contract for seniority system for hiring and firing