Hey, can someone give me hints as how to do this?

Prove that a k-regular graph with n vertices has at most n/(k+1) components.
Do we need to use pigeon hole principle?

Thanks!