Insert the following elements, one after the other, into an initially empty maximum binary heap: 1, 9, 8, 5,4, 10, 12, 7,6, 3. your answer should show the resulting maximum binary heap (in tree representation) after each insertion.

Write the pseudo code for this problem based on what you learned from the video. the purpose is to design a modular program that asks the user to enter a distance in kilometers, and then converts that distance to miles. the conversion formula is as follows: miles = kilometers x 0.6214