using python code

Problems C3: Hamiltonian Cycle - Hamiltonian Gycle in an undirected graph is a cycle that visits each vertex exactly once. - Given an undirected grap G=(V,E) in adjacency matrix Adj representation and a path P. - Hamiltonian Cycle Problem is an NP-hard problem. - Write a Python code that varifies whether a given path is a Hamiltonian Cycle or not. - Test the code using the following inputs: - Input: The graph and paths given below. - Output: Print "Given path is a Hamiltonian Cycle" or "Given path is not a Hamiltonian Cycle