The usual symbol for the maximum degree of any vertex in a graph is ?. Show that the chromatic number of a graph is no more than ? + 1. (In fact Brooks proved that if G is not complete or an odd cycle, then χ(G) ≤ ?. Though there are now many proofs of this fact, none are easy!)