True or false: The chromatic number of a graph is always bigger than the number of vertices of thegraph.None of these is correct.True because of Euler's Theorem.True because of Fermat's Last Theorem.O True because of Dijkstra's algorithm.True because of the Euler circuit.O False because chromatic numbers are a type of prime number and don't have anything to do with graphs.False because most graphs do not have a chromatic number.False because the chromatic number of any connected graph is 0.