use the well-ordering property to prove the Principle of Strong induction

I don't know how to start...

I know the well-ordering property is If S is a nonempy set of N, then there exists an element m ∈ S such that m≤k for all k∈S

and the Principle of Strong induction is:

Let P be property of N, assume:

1) P(1) holds

2) if P(1),...,P(n-1) hold, then P(n) holds ∀n≥2, then ∀n P(n)