Consider the problem of maximizing the function f$($x$)=($x$)^2+2$x$+1$ where X is permitted to vary between $0$ and $50.$ Solve the above principle with Genetic Algorithm and carry out two iterations.Code the decision variable x into finite length string using a five bit $($binary integer$)$ unsigned integer. Choose a random initial population of size $5.$ Crossover parameter: crossover probability is $80$ and single point crossover is to be used. Mutation parameter: crossover probability is $0\mathrm{.}5$ and flipping to be used