Right option is (d) 7
To explain: In a cycle of a graph G if we join all the vertices to the centre point, then that graph is called a wheel graph. There is always a Hamiltonian cycle in a wheel graph and there are n^2-3n+3 cycles. So, for order 5 the answer should be 7.