Priority Queue Code

In Mappy, we need to find the shortest route while taking into account traffic jams. The delay in minutes on a given street will determine its "priority" in the priority queue. Larger delay == lower priority.

Complete the empty, push, and pop methods.

1. empty(self) -> bool
   • Return True if the length of the elements list is 0, otherwise False.
2. push(self, priority: int, item: str) -> None
   • Append a tuple to the end of the elements list, in the form (priority, item).
3. pop(self) -> str | None – which removes the lowest-priority tuple from the list and returns its item
   1. If the elements list is empty, return None.
   2. Initialize a min_index_so_far to keep track of the index of the tuple with the smallest priority. It can start at 0.
   3. Loop over all the tuples in elements.
      • If a tuple has a priority smaller than the tuple at min_index_so_far, then update min_index_so_far to the index of the new tuple.
   4. Save the item at min_index_so_far to a variable.
   5. Delete the tuple at min_index_so_far from the list.
   6. Return the saved item.