Use the code provided to complete the problem in the picture using python with comments:

class MinHeap:

def $\_\_$init$\_\_($self$)$:

self.data $=[]$ # This list contains the heap elements

# The $\_\_$str$\_\_$ method simply returns the elements of the heap, in list form

def $\_\_$str$\_\_($self$)$:

return str$($self$.$data$)$

# Adds a new element to the heap

def add$($self$,$ new$\_$data$)$:

# First add the element to the end of the list $($maintains the complete

# tree property$)$

self.data.append$($new$\_$data$)$

# Index of the last list element

index $=$ len$($self$.$data$)-1$

# Do the "percolate up$"$ process $-$ swap the new node with its parent as

# many times as needed to maintain the min$-$heap property

while index $>0$: # Loop exits once we reach the root $($index $0)$

# Compare this element vs$.$ its parent

parent$\_$index $=($index $-1)//2$

# If the parent is larger than the child...

if self.data$[$parent$\_$index$]>$ self.data$[$index$]$:

# Swap the parent with the child

self.data$[$parent$\_$index$],$ self.data$[$index$]=$ self.data$[$index$],$ self.data$[$parent$\_$index$]$

# Update the current index

index $=$ parent$\_$index

# If the parent is $*$not$*$ larger than the child, the min$-$heap

# property isn't violated and we can stop

else:

break