P3) Let G be a graph and A(G) = max{d(v) : ve V} be its maximum degree. Prove by induction on the number of vertices that its chromatic number is at most 1 + A(G). Note here we are not assuming that the graph is planar. What must be shown is that there is a way to color the vertices of G using 1 + A(G) colors so that the endpoints of every edge have different colors