Question $3$

Consider a population of three chromosomes represented as binary strings for minimizing the function

$h(x)=x^2-10x+25$ over integers where $x$ ranges from $0$ to $31.$ The chromosomes are $11001,10110,$

and $11100.$ Perform one iteration of selection, crossover $($single$-$point$),$ and mutation $($with a mutation

probability of $0\mathrm{.}1$ per bit$).$