he 5-queens problem is the COP on a 5×5 chess board that is analogous to the 8-queens problemthat has been introduced in Chapter C1 in the lecture. In this exercise, we are interested in findinga solution for the 5-queens problem with different local search variants. Consider the followinginitial candidate:qqqqq(a) Depict the candidates that are considered by hill climbing with the heuristic and the neigh-borhood that are introduced on slide 23 of Chapter C1 in the print version of the lectureslides. If necessary, break ties in favor of candidates where the leftmost possible queen ismoved to a square that is as far up as possible. Annotate the candidates that are consideredduring search with the heuristic values of all neighbors