Specifications. Implement N$-$Queens genetic algorithm as described in lecture $5-1$ part $2.$

You can use the example input with the following parameters:

Number of queens: $N=10$

Population size: $S=10$

Number of breeding pairs: $r=2$

Mutation probability: $p=0\mathrm{.}1$

Number of generations: $m=10$

Remark: you may notice that with high probability one of the breeding chromosomes is already a satisfying state, so it'll be returned right away. But we'll be testing your work on sets of breeding pairs that do not contain satisfying state. So you should do so as well!