A $\textit{simple path}$ (respectively cycle) in a graph is a path (respectively cycle) in which no edge or vertex os repeated. The $length$ of such a path (respectively cycle) is the number of edges in the path (respectively cycle).
Let $G$ be an undirected graph with minimum degree $k \geq 2$.
Show that $G$ contains a simple cycle of length at least $k+1$.