1. Starting from a null root, construct a binary search tree T2 by applying insert() method to the sequence of numbers: 22, 60, 4, 2, 1, 5, 10. Assuming a remove implementation as we discussed in class (successor replacement), if we call T2.remove(4), what will be the child nodes of 22 after removal?