4. (5 pts) This instance will have you build a program that automatically builds a set of numbers into either a Min or Max Heap depending on the first integer entered. Prompt the user to enter an integer as the root of the binary tree that is to be built (remember, Heaps are a type of binary tree). Then, prompt the user for five more integers, asking the user to submit the following five as either smaller or larger than the root (the computer does not ask). Then, build the Min or Max Heap depending on the group of numbers submitted after the root. If the group of numbers submitted after the root does not conform with either a Min