You are given a predefined adjacency list representing a graph encoded in a pickle file.

Write a program (python3) to traverse this graph from the node 'A' in the depth-first search order, and print them out in a list format.

Description You are given a predefined adjacency list representing a graph encoded in a pickle file. Write a program to traverse this graph from the node ' A ' in the depth-first search order, and print them out in a list format. Input (From File: input.pkl) An adjacency list in a pickle file ("input.pkl") Ex: \{ 'A': ['B','C'] 'B': ['D','E'], 'C': ['F'], 'D': [], 'E': ['F'], 'F': [] Output (To File: stdio.txt) Standard Output: a list Ex: ['A', 'C', 'F', 'B', 'E', 'D'] \{ A:[B,C], 'B' : ['D', 'E'], 'C' : ['F'], 'D' :[], 'E' :[F], 'F' : [] \}