def remove$\_$min$($self$)->$ object:from dynamic$\_$array import $*$

class MinHeapException$($Exception$)$:

$"""$

Custom exception to be used by MinHeap class

DO NOT CHANGE THIS CLASS IN ANY WAY

$"""$

pass

class MinHeap:

def $\_\_$init$\_\_($self$,$ start$\_$heap$=$None$)$:

$"""$

Initialize a new MinHeap

DO NOT CHANGE THIS METHOD IN ANY WAY

$"""$

self.$\_$heap $=$ DynamicArray$()$

# populate MinHeap with initial values $($if provided$)$

# before using this feature, implement add$()$ method

if start$\_$heap:

for node in start$\_$heap:

self.add$($node$)$

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

$"""$

Return MinHeap content in human$-$readable form

DO NOT CHANGE THIS METHOD IN ANY WAY

$"""$

heap$\_$data $=[$self$.\_$heap$[$i$]$ for i in range$($self$.\_$heap.length$())]$

return "HEAP $"+$ str$($heap$\_$data$)$

def add$($self$,$ node: object$)->$ None:

$"""$

TODO: Write this implementation

$"""$

pass

def is$\_$empty$($self$)->$ bool:

$"""$

TODO: Write this implementation

$"""$

pass

def get$\_$min$($self$)->$ object:

$"""$

TODO: Write this implementation

$"""$

pass

def remove$\_$min$($self$)->$ object:

$"""$

TODO: Write this implementation

$"""$

pass

def build$\_$heap$($self$,$ da: DynamicArray$)->$ None:

$"""$

TODO: Write this implementation

$"""$

pass

def size$($self$)->$ int:

$"""$

TODO: Write this implementation

$"""$

pass

def clear$($self$)->$ None:

$"""$

TODO: Write this implementation

$"""$

pass

def heapsort$($da: DynamicArray$)->$ None:

$"""$

TODO: Write this implementation

$"""$

pass

# It's highly recommended that you implement the following optional #

# helper function for percolating elements down the MinHeap. You can call #

# this from inside the MinHeap class. You may edit the function definition. #

def $\_$percolate$\_$down$($da: DynamicArray, parent: int$)->$ None:

$"""$

TODO: Write your implementation

$"""$

pass

$"""$

TODO: Write this implementation

$"""$

pass