3. [1 pt] assume you were asked to 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). introduce a solution to use genetic algorithm to solve the game. a. explain the encoding of the state for genetic algorithm (i. e., the representation of the chromosome). show at least one state and the corresponding encoding [0.5 pt] b. explain the fitness function, the cross over, and the mutation process, respectively [0.5 pt].