he agent can move through the dot lines only. $2.$ Diagonal moves are not allowed. $3.$ Moves are considered in the following order: Up$,$ Right, Down, Left. $4.$ No state is visited twice. $5.$ A move up costs one, a move right costs $2,$ a move down costs $3$ and a move left costs $4($all these in some unit cost$).6.$ Break priority queue ties by choosing lower x$-$coordinates first, then y$-$coordinates if needed. $($a$)$ The agent is performing a Uniform Cost Search $($UCS$).$ What is the order of visit with UCS? $($b$)$ The agent is performing an A$*$ search. Consider h$($x$,$ y$)$ the heuristic defined by the Manhattan distance between the grid location at coordinates $($x$,$ y$)$ and the goal G located at $(1,3).$ The heuristic ignores the dashed lines or solid lines. $1.$ What is the value of the heuristic for each location in the maze? $2.$ What is the order of visit with A$*$ using the cost and the heuristic funct