now, we want to find a way to systematically insert the keys in the list into the tree while keeping it a bst. this solution will solve question a) above systematically. describe an algorithm to fill the tree completely.