(a) Draw a binary search tree whose elements are inserted in the following order: 11, 7, 13, 8, 12, 6, 20, 18, 2, 24, 17 (b) Given the binary search tree built in part (a), show the resulting binary search tree after deleting the node 18 using the deletion algorithm for binary search trees we studied in class. (c) Print out the original binary search tree in part (a) in pre-order, in-order, and post-order, respectively.