3. a) Start with an empty binary search tree and insert th following elements in the given order 20, 10, 30, 5, 25, 50,40, 60. Show the resulting tree. b) How many steps are needed to search and find 50 in the tree. Show the search path (one step is defined as accessing a tree node or falling off the tree) c) How many steps are needed to search and fail to find 15 in the tree. Show the search path. (one step is defined as accessing a tree node or falling off the tree) 4. a) Show four different binary search trees with values 20, 30, 40, 50. b) How many total binary search trees are there with values 20, 30, 40, 50. Show all