Prove Corollaries 11.4 and 11.5. Corollaries 11.4 Let G = (V, E) be a loop-free graph with

Question:

Prove Corollaries 11.4 and 11.5.
Corollaries 11.4
Let G = (V, E) be a loop-free graph with n (≥ 2) vertices. If deg(u) ≥ (n - l)/2 for all v ∈ V, then G has a Hamilton path.
Corollaries 11.5
If G = (V, E) is a loop-free undirected graph with |V| = n ≥ 3, and if deg(v) ≥ n/2 for all v ∈ V, then G has a Hamilton cycle.