(a) [5 points] What are the preorder, inorder, and postorder traversals of the binary tree below: M) (b) |5 points Insert 50, 40, 80, 30, 45, 70,90, 10, 60, 75, 85 to an empty Binary Search Tree. order. Show only the final tree after all deletion operations. g (c) |5 points] A binary search tree has a preorder traversal of P, F, B, M, K, S, R, Z. What Show only the final tree after all insertions. Then delete 45, 40, 80, 75,50 in given is its postorder traversal? Reconstruct the tree from those traversals and draw it