Arrange the following steps to determine if a graph is Hamiltonian in the correct sequence:
(A) Analyze the degrees of the vertices.
(B) Apply Dirac's or Ore's theorem if applicable.
(C) Attempt to find a Hamiltonian cycle or path through a trial-and-error method.
(D) Check for any obvious Hamiltonian cycles or paths.
(E) Conclude whether the graph is Hamiltonian or not based on findings.
Choose the correct answer from the options given below:
1
(A), (B), (C), (D), (E)
2
(A), (D), (B), (C), (E)
3
(D), (A), (C), (B), (E)
4
(B), (D), (A), (C), (E)