Find x(g) for the graph. question 1 options: 1 2 3 4 question 2 (1 point) find x(g) of the graph question 2 options: 2 3 4 5 question 3 (1 point) below is a map of the southeastern united states. what is the minimum number of colors required so that no two adjacent states have the same color? question 3 options: 2 3 4 5 question 4 (1 point) given the graph, which vertex coloring is correct? question 4 options: red (a, b, h); green (d, c, e); blue (g, f); yellow (i) red (a, c, f); green (b, d, g); blue (e, h); yellow (i) red (a, b, h); green (d, e, f); blue (c, g); yellow (i) red (a, d, e, f); green (c, g); blue (b, h); yellow (i) question 5 (1 point) the following is an appropriate color-map for the graph. question 5 options: true. no adjacent vertex has the same color. false. adjacent vertices have the same color. true. the chromatic number is 4. false. purple and orange should be switched on the inner star.