(a) [3 points] Prove that in a red-black tree the longest simple path from a node x to a descendant leaf is at most twice as long as the shortest simple path from x to a descendant leaf. (b) [2 points] Prove that a red-black tree with n nodes has N(n) black nodes