2. Draw the binary search tree after each operation. Each insertion and deletion operates on the original tree, and the new tree should again be a binary search tree 50 25 75 10 40 (60 90 35 70 37 (a) Insert 65 (b) Insert 35 (c) Delete 70 (d) Delete 60 (e) Delete 50