$[$Q$4.](6$p$)$ In this question you will use three informed search algorithms to find the path between $A$

and $G$ in the graph below: $($a$)$ Uniform Cost Search, $($b$)$ Best$-$first Search, and $($c$)A^{*}$ search.

Note that the edges are marked by the path cost $g$ and the nodes by the heuristic cost $h$ from the node

to the goal $G.$ For each algorithm you should show the content of the fringe and the closed list at each

step of the algorithm. Note that the fringe should contain paths, rather than nodes.