Assume the array xs$[0,...,$ n$1]$ encodes a heap with at most one node in violation of the $($max$)$ heap property. Explain the purpose, function, and correctness of the procedure MaxHeapify assuming node i$$s children are valid $($max$)$ heaps. Do the leaves ever need heapified?

Refer the screenshot for the Max$\_$Heapify$()$ function

def max$\_$heapify$($xs$,$ i$,$ n$)$:

while True:

li $=$ left$($i$)$

ri $=$ right$($i$)$

maxi $=$ i

if li $$ n and xs$[$li$]>$ xs$[$maxi$]$:

maxi $=$ li

if ri $$ n and xs$[$ri$]>$ xs$[$maxi$]$:

maxi $=$ ri

if maxi $==$ i:

break

swap$($xs$,$ i$,$ maxi$)$

i $=$ maxi