Given the binary search tree stored in an array using the computed child links strategy, answer the following questions: $(15$ points$)$

$\backslash$table$[[42,35,43,24,36,42,65]]$

$($a$).$ Draw the corresponding binary search tree

$($b$).$ What is the array after inserting the element $46$ so that the tree is still a binary search tree.

$($c$).$ What is the array after deleting the element $43$ so that the tree is still a binary search tree.