Below is a binary search tree: 60 41 74 16 53 65 25 46 55 63 70 42 62 64 Begin with this tree and show the BST that results after the operation or sequence of op performed on this tree: a. Insert 19 and 69 b. Delete 42 c. Delete 16 d. Delete 65 e. Delete the root node f. Display the output produced by an inorder traversal g. Display the output produced by a preorder traversal h. Display the output produced by a postorder traversal