KöMaL 2008 B4079

Let $G$ be a simple graph in which the longest path consists of $k \ge$3 edges and the degree of each vertex is at least $k$/2. Show that every edge of $G$ belongs to a circuit. (A path is a sequence of linking edges that visits each vertex at most once.)