$($Ex$.4\mathrm{.}5\mathrm{.}34)$ Show that the nodes of any AVL tree $T$ can be colored "red" and "black" so that $T$ becomes a red$-$black tree.