Binary Tree - BST. Provide step by step with detailed explanation on how to approach this porblem.

(a) What are results of the various traversals of the binary tree below? You must write all 4 following traversals a) in-order, b) post-order, c) pre-order, and d) level-order (b) Beginning with an empty binary search tree, what binary search tree is formed when you insert and remove the following values in the order given? Assume alphabetical order. Insert(S), Insert(V), Insert(P), Insert(A), Insert(B), Insert(D), Insert(Z), Insert(X), Insert(Y)