Assume the 5 red-black tree properties. Prove that for a tree with n internal nodes (not counting the null leaves) that the three will have a height of at most 2 log(n + 1)