******** only do part B **************

Given a set of 10 records with priorities S 10, 15, 3, 8, 20, 5, 17, 27, 19, 12) (a) Construct a BST T for S by inserting the records, in the given order, into an initially empty binary search tree. When done, delete 10, and then 20 from the tree. (b) Construct a BST T for S by inserting the records, in the reverse given order, into an initially empty binary search tree. When done, delete 5, and then 19 from the tree. Remark: You must show your BST after each insertion/deletion for credits. For deletion, if ambiguity arises, you must use deleteMin operations as discussed in class