Datsruct in C

its for max heap tree, but make it for min heap tree. Explain on how to make the program, its for learning purpose

Make a program that simulates Max Heap Tree. Below will describe the requirements.

$$ The program consists of $3$ menus, there are:

$1.$ Insert

$2.$ View

$3.$ Pop

$4.$ Exit

Figure $1.$ Main Menu

$$ If the user chooses Insert $($Menu $1),$ then:

$$ Ask the user to input a number. Validate that the number must be between $1$ and $100.$

$-$Insert the data into the tree$-$based Max Heap Tree concept.

$-$ If data has been successfully inputted, show the message $$Insert Success$.$

Figure $2.$ Insert Menu

$$

$$ If the user chooses View $($Menu $2),$ then print the tree to the screen$($like the image$)$

Figure $3.$ View Menu

$$ If the user chooses Pop $($Menu $3),$ then:

$-$if there is no data in the tree, print $$There is no data$.$

$-$ Delete the data of the root of the tree $($The tree should keep the max heap rules$).$

Figure $4.$ Delete Menu

$$ If the user chooses Exit $($Menu $4),$ then:

$-$ Delete all data in the tree.

$-$ Termintate the program.