1. Draw the binary search tree which results from inserting the following numbers, one after the other, from left to right:
10,2,7,6,12,3,1,8,11
. 2. Show the resulting binary search tree after deleting 12. Explain. 3. Show the resulting binary search tree after deleting 12 and 2. Explain. 4. Provide an insertion order for the same numbers, 10, 2, 7, 6, 12, 3, 1, 8,11, which will result in a tree with height of 3 . Draw the resulting tree.