Q$1$: a$-$ Apply the Breadth First Search, Depth First Search and Depth limited Search $($depth limit$=2)$ on the graph, where the start state is $($A$),$ and the goal is $($G$)$ Show the value of open and closed and the traversed path. b$-$ Write the basic Python implementation of BFS$,$ DFS of the previous graph: