Problem
1. Show how to implement the (standard) queue ADT using only a priority queue and one additional integer instance variable.
2. Describe in detail an implementation of a priority queue based on a sorted array. Show that this implementation achieves O(1) time for operations min and removeMin and O(n) time for operation insert.