A Hamiltonian cycle in a graph is defined as what? a. A cycle that includes at least half of the vertices b. A cycle that includes the maximum number of vertices c. A cycle that includes all the edges of the graph d. A cycle that visits every vertex exactly once and returns to the starting verte