What can you say about the relationship between |V| in a graph G = (V, E) and G's chromatic number if G is a clique?
a) The chromatic number is always less than the number of vertices if the graph is a clique.
b) The chromatic number is greater than the number of vertices if the graph is a clique.
c) The chromatic number is equal to the number of vertices if the graph is a clique.
d) The chromatic number is unpredictable if the graph is a clique.