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