*Please provide solution in C++ or Python (C++ Preferred)*

I have managed to gain access to the communications system in one of the rooms. I have written a program that will go from room to room collecting data, and eventually get it all back to me to send to my boss to help with their task. The problem is, that once a program goes through a room, that room will secure against the program from coming back. As such, I need to find a cycle through all of the rooms that goes to each exactly once and returns to its starting point. quickly put a program together that SOMETIMES finds a legal path, but doesn't always work. Given each of my certificates of potential Hamiltonian cycles, you must test each one and return a YES or NO as to whether it is legal. Input Format The first line contains N and M, the number of vertices and the number of edges in the graph, respectively. The next M lines each describe an edge, providing the IDs of the two vertices it connects The next line provides T, the number of test cycles The final T lines each provides a test cycles with N vertex IDs in the proposed order of traversal. Constraints 5 S N s 1000 5 s M s 50,000 Osvi