Consider the state space graph in FIGURE Q1. Draw the search tree and determine the route (list all opened states) when the following search algorithms are applied:
a. DFS (Depth First Search)
b. BFS (Breadth First Search)
c. UCS (Uniform Cost Search)
d. Greedy
e. A*
O)
a1e1S Ieop
Start State
n Heuristic estimate
1S0? dais
{9
01
FIGURE Q1: State Space Graph