A graph is color critical if the removal of any vertex decreases the graph's chromatic number. Show that every it-chromatic color critical graph G has the following properties: (a) G is connected. (b) Every vertex of G has degree greaterthanorequalto k - 1. (c) G has no vertex whose removal disconnects G.