Longest Path problem: Given a weighted graph G = (V,E), two distinguished vertices s, t V and a positive integer k, is there a simple path in G from s to t of length k or more?

Prove that the Longest Path problem is NP-Complete. (Hint: reduce the Hamiltonian Path problem to the Longest Path Problem)