write python code to generate code generate the answerQuestion $4$: Uninformed Search $[40$ pts$]$

You are given a graph consisting of ten states and the costs of connection between them for each state.

This question has the same requirements as Question $3$ bat with a differeat graph.

$($a$)[2\mathrm{.}5$ pts$]$ Draw the tree version of the graph that starts from $S$

$($b$)$ Perform Depth$-$first Search $($DFS$)$ from $S$ to $G$ :

$($b$\mathrm{.}1)[2\mathrm{.}5$ pts$][$Tree Search$]$ Show the part of the tree that DFS uses. E$.$g$.$ Fig. $??$ in Appendix A

$($b$\mathrm{.}2)[2\mathrm{.}5$ pts$][$Graph Search$]$ Show the graph search table of DFS$.$ E$.$g$.$ Tab$\mathrm{.}7?$ in Appendix A

$($b$\mathrm{.}3)[2\mathrm{.}5$ pts$]$ What is the path returned?

$($b$\mathrm{.}4)[2\mathrm{.}5$ pts$]$ What is the node expansion order?

$($b$\mathrm{.}5)[2\mathrm{.}5$ pts$]$ What is the path cost of the returned path?

$($c$)$ Perform Breadth$-$first Search $($BFS$)$ from $S$ to $G$ :

$($c$\mathrm{.}1)[2\mathrm{.}5$ pts$][$Tree Search$]$ Show the part of the tree that BFS usss. E$.$g$.$ Fig. $7?$ in Appendix A

$($c$\mathrm{.}2)[2\mathrm{.}5$ pts$][$Graph Search$]$ Show the graph search table of BFS$.$ E$.$g$.$ Tab.?? in Appendix A

$($c$\mathrm{.}3)[2\mathrm{.}5$ pts$]$ What is the path returned?

$($c$\mathrm{.}4)[2\mathrm{.}5$ pts$]$ What is the node expansion order?

$($c$\mathrm{.}5)$ pts$]$ What is the path cost of the returned path?

$($d$)$ Perform Uniform$-$cost Search $($UCS$)$ from $S$ to $G$ :

$($d$\mathrm{.}1)[2\mathrm{.}5$ pts$][$Tree Search$]$ Show the part of the tree that UCS uses. E$.$g$.$ Fig. $7?$ in Appendix A

$($d$\mathrm{.}2)[2\mathrm{.}5$ pts$][$Graph Search$]$ Show the graph search table of UCS. E$.$g$.$ Tah.?? in Appendix A

$($d$\mathrm{.}3)[2\mathrm{.}5$ pts$]$ What is the path returned?

$($d$\mathrm{.}4)[2\mathrm{.}5$ pts$]$ What is the node expansion order?

$($d$\mathrm{.}5)$ pts$]$ What is the path cost of the returned path?