This problem requires you to use a heap to store items, but instead of using a key of an item to determine where to store the item in the heap, you need to assign a priority (key) to each item that will determine where it is inserted in the heap

a) Show how to assign priorities to items to implement a first-in, first-out queue with a heap.

b) Show how to assign priorities to items to implement a first-in, last-out stack with a heap.