2. (8 points) Suppose Binary_Search_Tree variable t has the following value 35 15 40 5 38 42 (a) Draw the tree that results after executing (all of) the following operations: t.insert (25) t.insert (12) t.insert (30) t.erase (38) t erase (5) t.erase (35) (b) Give the order the nodes of the resulting tree from part (a) are visited when the tree is traversed by in-order, pre-order, and post-order scans