Write a PYTHON code to do the exploration of the following graph using Depth First Searching algorithm HARDWARE AND SOFTWARE REQUIREMENTS: PC/LAPTOP WINDOWS 7/10/XP etc., PYTHON COMMUNITY VERSION GOOGLE COLAB PROCEDURE: 1. First define the adjacent list of the graph in the python code. 2. Use visited. level and parent arrays to implement the Depth First Search 3. In DFS algorithm implement the stack to visit neighboring nodes. 4. In DFS algorithm first finish full depth of one particular node in the graph to explore then backtrack to the next immediate upper level to visit next neighbor depth. Follow this exploration method to vist all the nodes in the graph. 5. After traversing the entire graph by DFS algorithm, print the path of graph