Could anyone please help me with this question? Thanks a lot!

Suppose in the 4-queens problem we use a sequence of four digits 1-4 to represent the row of each queen in its respective column. Suppose also that the neighbors of the current node are generated by moving only a single queen one cell up or down, and that the objective function h is simply the number of attacking pairs. Let the initial state be no - [1,4, 1,4 (a) Using simple Hill Climbing (actually, we're trying to minimize the objective function in this case), write the sequence of steps until the process terminates. For each step, write down the current state, the value of the objective function, and a sorted list of neighbor states (sort in ascending order of h-value, and then according to values in each state's list of numbers). b) Given how neighbors are generated, is Hill Climbing guaranteed to find a solution? How about if a suc- cessor state no worse than the current one can be chosen? If not, give an example of a configuration that cannot be solved. Suppose in the 4-queens problem we use a sequence of four digits 1-4 to represent the row of each queen in its respective column. Suppose also that the neighbors of the current node are generated by moving only a single queen one cell up or down, and that the objective function h is simply the number of attacking pairs. Let the initial state be no - [1,4, 1,4 (a) Using simple Hill Climbing (actually, we're trying to minimize the objective function in this case), write the sequence of steps until the process terminates. For each step, write down the current state, the value of the objective function, and a sorted list of neighbor states (sort in ascending order of h-value, and then according to values in each state's list of numbers). b) Given how neighbors are generated, is Hill Climbing guaranteed to find a solution? How about if a suc- cessor state no worse than the current one can be chosen? If not, give an example of a configuration that cannot be solved