The search problem is specified as follows.

line $1$: start state

line $2$: list of goal states separated by a space

line $3...($n$+2)$: $($n $=$ number of states$)$ heuristic for each state

line $($n$+3)...$ end: state transitions of the form

Note that we don$$t need the transition cost nor the heuristic for solving problem $1.$ However,

you should implement the parsing for everything now so that you don$$t have to make

modifications later.

You should decide on an appropriate data structure for the problem and return it from the

following function in parse.py$.$

def read$\_$graph$\_$search$\_$problem$($file$\_$path$)$:

#Your p$1$ code here

problem $=\text{'}\text{'}$

return problem

Once your implementation of both read$\_$graph$\_$search$\_$problem and dfs$\_$search is

complete you can verify that you pass the first test case as follows. implement DFS search.