Please Include the draw to show which queens can attack each other and non attacking each other for each one in part A and B I want to understand the question. Please Clear handwriting.

Figure 4 shows an 8-Queen board layout and its genetic string code. Using same encoding format, to complete the following tasks (8-Queens problem: place 8 queens on an 8x8 chessboard such that no two queens can attack each other (i.e. share the same row, column, or diagonal).

a. For the following three individuals, please calculate fitness score for each of them (the fitness score is defined as number of queen pairs not attacking each other. The order of the queen does not matter. For example, queen 3 attacking queen 5 is equivalent to queen 5 attacking queen 3). X1=36482571 X2=63188183 X3=56788372

b. Select the two individuals with the highest fitness scores to generate two children using cross-over to mix parents genetic code. The site of the cross-over is selected as 3 (i.e., after the third queens position). Report fitness scores for both children.

c. Explain the strength and weakness of genetic algorithms in solving search tasks. [0.5]