Answer the following questions about binary search trees (BSTs). (a) Draw the final BST after inserting elements 29, 38, 13, 6, 21, 17, 25, 30, 10, 8, 32 in that order. (b) Draw the tree after deleting 25 from the BST in (a). (c) Draw the tree after deleting 38 from (b). (d) Draw the tree after deleting 13 from (c). (e) List the elements of pre-order, in-order, and post-order traversals of the tree from (d).