The problem is as follows:

-------------------------------------------------------------------------------------------------------------------------

G=(V,E) is an undirected graph with |V|=n. If degree(vi)>n/2 for all i=1,2,...,n then prove that G must have a Hamiltonian Path.

PLEASE HELP!!!