Mr. Monroe is teaching his CSB class about Priority Queues! Priority Queues are automatically created as min heaps. A min heap is a binary tree where all of the parent nodes have lower numerical values than their children. For a major grade, you must create a method that adds an integer to a priority queue and heapifys it. For assistance, view an example of a min heap at http://www.algolist.net/Data_structures/Binary_heap/Insertion. (No loops needed)