Hi, I need help on 2 A,B and C please. Explain why its that answer. Please write clean becuse I have hard time of seeing. Thank you

ZX CTR ALT ALT FN CIS-277 Data Structures and Algorithms Review: ADTs -Queue, Priority Queue, and Dequeue 2 Define the ADT: a. queue 2 Indicate the Big-0 rate of growth of run-time for: b. dequeue cpriority queue a. insertion into a queue that is implemented using an ordinary array with the front of the queue always maintained in component zero of the array 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. 3. Given the following list of jobs and their associated priority (back) 1 314 121 113 I214I (front) Assuming that no other jobs arrive, list the order in which these jobs would be processed if: . 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 form of the data structure that you would use to implement this ADT (include a diagram) Given that a queue is being represented by the following circlar representation in an array (front is currently 4 and back is currently 7)