PROBLEM 6: Suppose we insert keys below into an initially empty binary search tree in the given order: 6, 9, 2, 1, 5, 7, 10, 8, 3, 4 (a) Draw the resulting binary search tree. (b) List the keys according to A pre-order traversal An in-order traversal A post-order traversal (c) Now we perform some deletions using the "deletion by copying" strategy in which promoted keys are always drawn from a node's right subtree (so that there is only one correct answer). (i) Simulate the deletion of 2 and draw the resulting tree. State any relevant assumptions. (i) Now (on the resulting tree) simulate the deletion of 6 and draw the resulting tree. Again, stating any relevant assumptions