Q:Question:Suppose the numbers \( 7,12,3,6,21,56,2,15,9,5 \) are inserted in that order into an initially empty binary search tree. The binary search tree uses the usual ordering on natural numbers. i. Draw the binary search tree after all nodes are inserted. ii. Derive preorder, postorder and inorder sequences.A:Answer:See a step by step answer