A robot is trying to find its way from a starting point to a goal point in a maze. The maze is represented by a

graph, where each node in the graph represents a possible location of the robot, and each edge in the

graph represents a possible move that the robot can make. For each of the following search strategies in

the graph below, show the order in which states are expanded and the path returned by the graph

search and answer the following questions:

$($a$)$ Describe the breadth$-$first search algorithm for solving this search problem.

$($b$)$ Describe the uniform$-$cost search algorithm for solving this search problem.

$($c$)$ Describe the greedy best$-$first search algorithm for solving this search problem.

$($d$)$ Describe the $A^{**}$ search algorithm for solving this search problem.

$($e$)$ Given a heuristic function $h(n)$ that estimates the distance from node $n$ to the goal, is $h(n)$ admissible?

Explain why or why not.

Note: Ties are solved in alphabetical order. The heuristic table is shown below.

Goal $0$