Draw the bst formed by the given set of integers. remember to use successive adds to arrive at your final tree. (you do not need to show all the intermediate steps, however, showing those can in case you make a final somewhere down the line.)1, 19, 7, 5, 6, 42, 21, 13, 56, 78, 29, 3, 14a. do a preorder and postorder traversal of the bst formed in part a. b. perform the following operations on the completed bst: delete(14); add(45)