Draw this out for me:

For this question use the array representation to draw the Binary Search Tree and each of the operations out before answering the questions:

For questions $1-6$ use the following BST as the starting point, remember that each operation will progressively change the BST:

BST $=[121,63,148,31,$ null, null, null, $167]$

Insert $79$ into the BST and give the resulting array representation.

Insert $24$ into the BST and give the resulting array representation.

Insert $161$ into the BST and give the resulting array representation.

Insert $141$ into the BST and give the resulting array representation.

Insert $66$ into the BST and give the resulting array representation.

Using your final array representation, draw the resulting Binary Search Tree after all of the operations are performed.