1 The graph \(G\) has a subgraph isomorphic to \(K _ { 5 }\), the complete graph with 5 vertices. Which of the following statements about \(G\) must be true? Tick ( \(\checkmark\) ) one box.
\(G\) is not connected
\includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-03_104_108_872_973}
\(G\) is not Hamiltonian
\includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-03_108_108_1005_973} G is not planar
\includegraphics[max width=\textwidth, alt={}, center]{bcb1dd40-4e54-4ac7-a623-3a4b46e3ea9d-03_108_108_1142_973}
\(G\) is not simple □