Problem: Consider the binary-search-tree shown in Figure 1. Perform the following operations the order shown below starting from that configuration. Draw the tree after each operatien sa been performed. (a) insert 12 (b) insert 8 (c) delete 4 (d) delete 9 (e) delete 3 In case a node to be deleted has two ci ldren, then replace the node with its successora delete the successor from its original position. 10 2