In above picture is simple binary tree. Convert this binary tree into "Max Heap" Using below mentioned algorithm.

Perform each step complete dry run. All swaping occurence show in another step. for example 5 swaping. show 5 steps and 1 swaping in each step. And mention the algorithm line what happen what line are execute in this step. algorithm mention below:-

In swaping algorithm line mentioned what line is executed. complete dry run. only one swaping in one step.

9 80