Which type of proof is best for this problem?

Show that every graph without self$-$loops and having two or more nodes contains two nodes that have equal degrees.

a$.$

proof by construction

b$.$

proof by contradiction

c$.$

proof by induction