it's discrete math, answer please

QUESTION 1 Find the chromatic number of the graph below. QUESTION 2 Ky is not planar. O True O False QUESTION 3 Some convex polyhedron cannot be projected onto the plane without edges crossing. O True False QUESTION 4 What is the smallest number of colors you need to properly color the vertices of Ka,4 ? QUESTION 5 The chromatic number of a graph G is at least the clique number of G. O True O False QUESTION 6 What is the chromatic number of any tree? QUESTION 7 A graph has an Euler path if and only if there are at most two vertices with even degree. O True False QUESTION 8 What is the chromatic number of K-? QUESTION 9 A graph has an Euler circuit if and only if the degree of every vertex is even. O True O False QUESTION 10 What is the chromatic number of the graph below