I need help with this Artificial Intelligence problem. Thank you.

Figure 1 is the initial state of an 8-Queens problem and figure 2 is the goal state, solved with the A* search algorithm.

a) Report the final goal state (solution) and the f(N) values of each step (from the initial state to the goal state)

b) For the same initial state shown in Figure 1, explain why hill climbing search stops before getting to the end. Suggest how to solve the problem to solve 8-queens using hill-climbing search.

N-Queens Application 8 Queens Complete-State A search (attacking pair heuristic) Clear Prepare Run Step Pause Cancel Figure 1 N-Queens Application 8 Queens Complete-State A search (attacking pair heuristic) Clear Prepare Run Step Pause Cancel Figure 1