USING JAVA

Turn the following array$-$based binary tree into a max$-$heap. Show your work step by step. You will not need all the columns; Use null to fill the unneeded spaces. Use scratch paper to draw the trees at each step.

$\backslash$table$[[38,,,,,,],[18,,,,,,],[24,,,,,,],[52,,,,,,],[43,,,,,,],[34,,,,,,],[26,,,,,,],[,,,,,,]]$

NOTE: the following chart shows what the answer should be$.$ It will NOT appear on the exam, but is placed here for your convenience.

$\backslash$table$[[38,38,52,52,$null,null$],[18,52,38,43,$null,null$],[34,34,34,34,$null,null$],[52,18,18,18,$null,null$],[43,43,43,38,$null,null$],[24,24,24,24,$null,null$],[26,26,26,26,$null,null$]]$