Answer 3 and 4

Revieui ADQunue, Priority Queue, and Dequeue ? Define the ADT: a.queue e priority queue 2 Indicate the Big o rate of gcouth of cun-time for s insertion into a queue that is implemented uaing an ordinaty component zexo obe always array with the front of the queue always maintained in componment zero of the array front of the queue always maintained in array with the component zero of the array using an ordinary c. deletion trom a queue using a cireular array implementstion Given the following 1ist of jobs and their associated priority class (the lower the number the higher the priority) (back) 314211 3 24ront) Assuming that no other jobs acrive, 1ist the order in which these jobs would be processed if a. apriority queue is used b. describe three different schemes by which a priority class might be assigned to a job c, explain what is meant by "starvation" d explain what is meant by "aging" e. briefly describe the form of the data structure that you would use to implement this ADT (include a diagram) 4. Given that a queue is being represented by the following circlar representation in an array (front is currently 4 and back is currently 7) array component 1 37 41 12 1 34 a show what this representation would like after the following sequence of operations are performed: deq (q, il degiq, 11 engiq, 81) engig, 72) enqiq, 38) degiq, k) (indicate the current position of front and back) b. what is an advantage of this implementation of a queue ? c. what is a disadvantage of this implementation of a gueue