^{_{All answers to this question on Chegg are wrong. The code is tested and the answers received dislikes and bad reviews. Read the question carefully: (the least priority should give 0, the next should give 1, 2, 3 etc, and if there are similar priorities should have similar results e.g. priority 12 and priority 12 should be compacted to 2). Please, Read the question before answering and don't copy a wrong code from a previous answer! (This is the fourth time I post the question with wrong answers, in addition to other students' posts)}}

Jo has a tendency to not maintain the priorities very well, adding new customers as high priorities to get them out of the way faster; this often leads to lots of priorities with an excessively large range. These priorities need to be 'compacted', so if Jo has a queue that looks like this: then a compact method would refactor the queue to look like this: Outline in English an algorithm to carry out the requirements of compact . An outline in English should not be program code or pseudo-code; see Section 6.4.1 for further guidance on outlining algorithms in English. Not using an English outline will lead to marks being deducted. Write your answer here Q2(c)(ii) (10 marks) The class code has been repeated below. Edit the code below to implement your compact algorithm from part (c)(i) as a method. For this question you may use any standard Python methods that belong to the dict or list objects if you wish, although it is not required to deviate from those included in the book. def print_queue(self) None: """ Prints the current state of the priority queue """ print('[') for item in self.items: print(', item) print(']') \#\#\# ADD YOUR CODE HERE \#\#\#