Let P(n) be the following sentence: Given any graph G with n vertices satisfying the condition that every vertex of G has degree at most M, then the vertices of G can be colored with at most M + 1 colors in such a way that no two adjacent vertices have the same color. Use mathematical induction to prove this statement is true for every integer n 1.