"YOU CAN USE Draw.io Or directly draw the diagram with your hands on a piece of paper. I can use tools to draw a diagram. I cannot provide you with an editable diagram now because all I have is a non editable pdf "

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. 2. Search Tree with Costs (1 point) - Complete the search tree indicating the corresponding cost for each node in the form: g(n) and h(n). 3. DFS (1 point) a) Write down the order in which the nodes are visited until the solution is found. b) Write the solution found by the algorithm. 4. BFS (1 point) a) Write down the order in which the nodes are visited until the solution is found. b) Write the solution found by the algorithm. 5. Greedy - Unary Cost (1 point) a) Write down the order in which the nodes are visited until the solution is found. b) Write the solution found by the algorithm. 6. Heuristic (1 point) a) Write down the order in which the nodes are visited until the solution is found. b) Write the solution found by the algorithm. 7. A (1 point) a) Write down the order in which the nodes are visited until the solution is found. b) Write the solution found by the algorithm. 8. The Minimax algorithm (1.5 points) The following example has two players: white and black, white moves first. Fill in the nodes corresponding to each player with the values obtained by the minimax algorithm. 9. Alpha-Beta Pruning (1.5 points) Indicate the values [alpha, beta] for the following example and how the pruning is applied