The 8-Queen problem is to place eight queens on an 8x8 chessboard such that no queen attacks any other. Queens will attack the other when at least one of other queen is on the same row or column or diagonal with her. a) Define an objective function for the 8-queen problem and calculate the value for the example given above. b) Explain why Genetic Algorithm works for the 8-Queens problem? c) Explain the FIVE steps of Genetic Algorithm for searching the solution of the 8-Queen problem using the following example: 24748552 24 31% 32752411 32748552 32748152 32752411 23 29% 24748552 24752411 24752411 24415124 20 26% 32752411 32752124 32252124 32543213 11 14% 24415124 24415411 24415417 (a) (b) Initial Population Fitness Function (c) (d) (e) Selection Crossover Mutation