computer science - data structures and algorithms question :

please show how did you solve it

Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices? Select one: a. At least three vertices have the same degree. b. All vertices have the same degree. c. At least two vertices have the same degree. d. No two vertices have the same degree