How to approach this with longest path technique of the following problem

Question

Let k ≥ 3 and δ ≥ 2. Prove that if G is a simple graph such that δmin(G) ≥ δ and every cycle of G has length at least k, then G contains a cycle of length at least (δ − 1)(k − 2) + 2.