prove the chromatic number of any tree is two. recall, a tree is a connected graph with no cycles. (a) describe a procedure to color the tree below. (b) the chromatic number of cn is two when n is even. what goes wrong when n is odd? (c) prove that your procedure from part (a) always works for any tree. (d) now, prove using induction that every tree has chromatic numbe