How many unique colors will be required for proper vertex coloring of a complete 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 a complete graph having n vertices?
A.	0
B.	1
C.	n
D.	n!
Answer» D. n!