Q. Let FHAM be the problem of finding a Hamiltonian cycle in a graph G and DHAM be the problem of determining if a Hamiltonial cycle exists in a graph. Which one of the following is TRUE? (Solved)
1. Both FHAM and DHAM are NP-hard
2. FHAM is NP hard, but DHAM is not
3. DHAM is NP hard, but FHAM is not
4. Neither FHAM nor DHAM is NP hard
- a. Both FHAM and DHAM are NP-hard