How many unique colors will be required for proper vertex coloring of an empty graph having n vertices?

How many unique colors will be required for proper vertex coloring of

1.	How many unique colors will be required for proper vertex coloring of an empty graph having n vertices?
A.	0
B.	1
C.	2
D.	n
Answer» C. 2