Hi, I need help with question 2 A-C, number 3 and number 4 A-C. Please do all the problems hat I assign and please write clean because I have hard time seeing. If you do not do all the problems that I assign then please do not do it at all because this is my last question to ask then I cant ask any more questions. Thank you.

CIS-277 Data structures and Algorithms Revieu: ADTs - Queve, Priority Queue, and Dequeue Define the ADT: a. queue . dequeue . priority queue 2 Indicate the Big-o rate of growth of run-time for: a. insertion into a queue that is implemented using an ordinary b. deletion from a queue that is implemented using an ordinary c. deletion from a queue using a circular array implementation class (the lower the number the higher the priority): array with the front of the queue always maintained in component zero of the array. array with the front of the queue always maintained in component zero of the array 37 Given the following list of jobs and their associated priority (back) 131 4121 113 1 2 1 I (front) Assuming that no other jobs arrive, list the order in which these jobs would be processed if: a. a priority 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 fom 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 circular repzesentation in an array (Eront is currently 4 and back is currently 7): array component: III1371 41 1 121341 a. show what this representation would like after the following sequence of operations are performed: deqiq. l engiq, 81); eng(q. 72): engig, 381 deqiq, k): lindicate the current position of front and back) what is an advantage of this implementation of a queue? C. what is a disadvantage of this implementation of a queue