create a max heap program note: Must use find and remove that will traverse the queue and find and remove elements. 1: Adds an element 2 (Remove the top (root)) always removes the top of the heap 3 (Remove element) will remove an element found in the tree (if it exists) 4 (Find element) verifies if an element is found on the heap; it does not add or remove it. 5 (Print heap) will print the tree, in a stepwise fashion. Must use find and remove to traverse the queue and find or remove elements. populate the heap with 78 69 67 47 42 37 31 23 12 should print 78 69 67 47 42 37 311 23 12 6 QUIT