In a simple, connected graph G on 30 vertices the degree of each vertex is at least 10. We know that G has an edge such that after deleting it we get a non-connected graph. Show that G has a Hamilton path.