Part 1:
For both the DFS and BFS algorithms, answer the following:
Describe this algorithm in your own words. What are the steps for searching any tree using these algorithms?
Describe the trees that can be used with DFS and BFS. What are the limitations of these trees?
Part 2:
For both Python examples, answer the following:
Describe the example code. What is it? What does it do?
Give several screenshots for your program running in Idle. Run it, Demonstrate how it works.
Change the DFS code to search for a different nodes. For example, it is currently searching for node ‘a’, change this to search for node ‘d’:
