Graphs, graph algorithms and methods, and graph theory are integral to IT and computer science applications and coding. For this assignment,

1. What is a Hamiltonian cycle?
2. What is a Euler cycle?
3. What is a minimum length Hamiltonian cycle?
4. Given a graph with n edges, what is the time complexity of finding a Euler path? Is this a polynomial time algorithm? Explain and show all work and the graph. Hint: Include the algorithm and pseudocode.