Using the definitions on p. 1177 of our textbook for depth of a tree node and height of a tree, consider the set of keys K = and the different possible insertion orders for the keys in K. Based on the different possible insertion orders and their resulting Binary Search Trees, answer the following questions. a) What is the minimum height of a Binary Search Tree constructed from K? Show an insertion order for the keys in K that generates a Binary Search Tree of minimum height. Draw the corresponding Binary Search Tree. b) Are there any other insertion orders (beyond what you found in (a) above) for the keys in K that produce a Binary Search Tree of minimum height? If so, provide one such sample insertion order and its accompanying Binary Search Tree. c) What is the maximum height of a Binary Search Tree constructed from K? Show an insertion order for the keys in K that generates a Binary Search Tree of maximum height. Draw the corresponding Binary Search Tree. Exercise 12.2-5 on p. 293 in textbook. For the set of keys given above in Problem 1, show the Binary Search Tree resulting from inserting the keys in the order given: K = . Is it possible to color the resulting Binary Search Tree so that it becomes a red-black tree? Either prove that it is not possible or show a legal coloring that makes it a red-black tree. For the set of keys given above in Problem 1, show the sequence of red-black trees that result after successively inserting the keys into an initially empty red-black tree in the order given: K = . (Show at least one tree resulting from each insertion). State which case from the textbook applies. Assume that the root is always colored black.)