>>106187711
can you solve this with your knowledge?
Part 3 – Data Structures and Algorithms (25 points)
3.1 (12 pts) Implement a priority queue using only lists.
It must allow:
insert(element, priority)
extract() returns and removes the element with the highest priority.
Display the entire queue.
Lower priority numbers mean higher priority (1 is more important than 5).
3.2 (13 pts) Implement the insertion sort algorithm in a function insertion_sort(lst) and use it to sort a list of randomly generated numbers.
You may not use sorted() or .sort().