Exercise 1•Ai-foundation
Question
Question
Write Python code to implement DFS (Depth First Search) to find a path from start 'A' to goal 'G' in a graph represented as adjacency list. Graph: {'A':['B','C'], 'B':['D'], 'C':['E','F'], 'E':['G'], 'F':['G']}. Print the path.