An algorithm is complete if it ends with a solution when one exists. There are different strategies to find a solution. The main differences between complete algorithms lies in selecting the next state, i$.$e$.,$ the way in which the nodes are visited varies according to the algorithm used.

In this section, you will carry out several exercises to analyze how different algorithms search to find a solution to the same problem.

$1.$ Search Tree $(1$ point$)$

Transform the following maze into its corresponding search tree. Label each node with its corresponding row, col coordinate.

Consider that each grid corresponds to the cell of a matrix. The cells in the matrix will be numbered starting at the top left corner $(1,1)$ and ending at the bottom right corner $($rows$,$ columns$).$

Consider the search tree written above to answer the exercises considering the following cost formulas, or node order, to perform a search where applicable.

Node order: NESW $($use this order for uninformed search and when there is a tie$)$

g$($n$)$ Steps needed to get n from the starting point.

h$($n$)$ the Manhattan Distance to reach the $$End$$ from n$.$