Consider a binary search tree that contains n nodes with keys 1, 2, 3, ellipsis, n. the shape of the tree depends on the order in which the keys have been inserted in the tree. in what order, should the keys be inserted into the binary search tree to obtain tree with minimal height? On the tree obtained in (a), what would be the worst-case running time of a fn insert, or remove operation? Use the big-Oh notation. in what order, should the keys be inserted into the binary search tree to obtain tree with maximal height? On the tree obtained in (c), what would be the worst-case running time of a insert, or remove operation? Use the big-Oh notation