Question 1: Given the following binary search tree bst: We are executing the following sequence of operations (one after the other): bst [6]= None bst [12] = None bst [4]= None bst [14]= None del bst [7] del bst [9] del bst[13] del bst [1] del bst[3] Draw the resulting tree after each one of the operations above