Problem 1. An undirected graph G has width w if the vertices can be arranged in a se- quence V1,2,3,…,Vn such that each vertex v; is joined by an edge to at most w preceding vertices. (Vertex vj precedes if i.) Use induction to prove that every graph with width at most w is (w+1)-colorable