$[1\mathrm{.}5$ pt$]$ The "Informed Search to Play Maze $[$Notebook$,$ html$]"$ posted on Canvas

shows a Maze game using A$-$Star Search $($AStar$),$ Greedy Best First $($GBF$)$ and Uniform

Cost Search $($UCS$)($using "AStar", $"$GBF$",$ or "UCS" as parameters$).$ Use Notebook as the

skeleton code, validate and compare following settings and results.

a$.$ Using Figure $7$ as the game field, and set initial state as $0,0$ and goal state as $9,9.$

Use A$-$Star Search $($AStar$),$ Greedy Best First $($GBF$)$ and Uniform Cost Search $($UCS$)$

to find path from initial state to goal state, respectively.Report path of each method

$[0\mathrm{.}25pt,$ and explain which method is optimal$/$not optimal, why? $[0\mathrm{.}25$ pt$].$

b$.$ What is advantage of AStar search, comparing to greedy best first search $($GBF$)$ and

Uniform Cost Search $[0\mathrm{.}5$ pt$]$

c$.$ What is advantage of Greedy Best First search, comparing to A$-$Star search $($AStar$)$

and Uniform Cost Search $0\mathrm{.}5pt$