2. (20 Points) Let G be a k-connected graph, where k > 2, and let S be a set of k vertices in G. Show that G contains a cycle C that includes every vertex of S. 2. (20 Points) Let G be a k-connected graph, where k > 2, and let S be a set of k vertices in G. Show that G contains a cycle C that includes every vertex of S