77 e arch-for Integer 'target , in A found binarySearch (data.currentItem ), target) 5 data.goForth O Using the active operation approach to timing analysis determine the time complexity of this pseu- docode in the worst case. Assume that the list of arrays contains n arrays and that each array has exactly m items in it. Show all your work and express your final answer in Big-O notation. Question 8 (17 points) A priority queue is a queue where a numeric priority is associated with each element. Access to elements that have been inserted into the queue is limited to inspection and removal of the elements with smallest and largest priority only. A priority queue may have multiple items that are of equal Give the ADT specification for a bounded priority queue using the specification method described in Topic 7 of the lecture notes. By "bounded", it is meant that the priority queue has a maximum capacity specified when it is created, and it can never contain more than that number of items. Your specification must specify the following operations: Page 3 newPriorityQueue: make a new queue insert: inserts an element with a certain priority isEmpty: test if the queue is empty isFull: test if the queue is full maxltem: obtain the item in the queue with the highest priority minltem: obtain the item in the queue with the lowest priority delete deleteAlIMax: remove from the queue all items that are tied for the highest priority delete Min: remove from the queue the item with the lowest priority frequency: obtain the number of times a certain item occurs in the queue (with any priority) Max: remove from the queue the item with the highest priority 8 6 9 77 e arch-for Integer 'target , in A found binarySearch (data.currentItem ), target) 5 data.goForth O Using the active operation approach to timing analysis determine the time complexity of this pseu- docode in the worst case. Assume that the list of arrays contains n arrays and that each array has exactly m items in it. Show all your work and express your final answer in Big-O notation. Question 8 (17 points) A priority queue is a queue where a numeric priority is associated with each element. Access to elements that have been inserted into the queue is limited to inspection and removal of the elements with smallest and largest priority only. A priority queue may have multiple items that are of equal Give the ADT specification for a bounded priority queue using the specification method described in Topic 7 of the lecture notes. By "bounded", it is meant that the priority queue has a maximum capacity specified when it is created, and it can never contain more than that number of items. Your specification must specify the following operations: Page 3 newPriorityQueue: make a new queue insert: inserts an element with a certain priority isEmpty: test if the queue is empty isFull: test if the queue is full maxltem: obtain the item in the queue with the highest priority minltem: obtain the item in the queue with the lowest priority delete deleteAlIMax: remove from the queue all items that are tied for the highest priority delete Min: remove from the queue the item with the lowest priority frequency: obtain the number of times a certain item occurs in the queue (with any priority) Max: remove from the queue the item with the highest priority 8 6 9