Which of the following is an NP complete problem?

• A. Hamiltonian cycle
• B. Travelling salesman problem
• C. Calculating chromatic number of graph
• D. Finding maximum element in an array