Given the following search tree, which algorithm(s) will find the suboptimal goal node?

Which algorithm(s) will visit the least number of nodes until finding a goal node?

For which node should we adjust the heuristic value h in the search tree to ensure the heuristic function becomes admissible?

What is the Chebyshev distance between the two states?

Given the following search tree, which algorithm(s) will find the optimal goal node?

What is the Euclidean distance between the two states?

Given the search tree above, answer the following questions:

- Is the heuristic function h admissible?

With which data structure would you implement the fringe of the BFS algorithm? 

Which of the following algorithm(s) finds the solution in the least number of steps (= expansion of nodes) for the given search tree?