Prove that if G is a simple graph with minimum degree k, where k $\displaystyle \geq$ 2 then G has a path of length at least k.

I've been bouncing through ideas all day but I keep finding flaws in them. I feel like I must show that G is hamiltonian but I do not know how to do that.

Any help is appreciated, plus rep like always.

Thanks