please answer in C$++$ Consider a ternary heap structure.

Given the BuildHeap $()$ procedure below to build a heap from an array H:

BuildHeap$($H$)$ :

for $\backslash (\backslash$mathrm$\{$k$\}=\backslash )$ floor$($H$.$size$()-2)/3)$ downto $0$:

H$.$heapify$($k$)$

Applying the BuildHeap$()$ procedure to the tree above,

a$.$ Redraw the tree after each time the heapify$()$ method is called. every step

b$.$ Write out the final array.

c$.$ Now the array H becomes a heap. What would H become if the delete$\_$min$()$ method is called?

d$.$ Write the code for the heapify$()$ method. please answer in C$++$