In class it was shown that a red-black tree with n internal nodes has height at most 2 log(n+ 1). Show that this bound is asymptotically tight, i.e., describe a red-black tree on n nodes and height h for which the ratio h/2 log(n+ 1) approaches 1 as n approaches infinity. (The tree is not unique.)