Considerfiche following nonconvex programming problem.

Maximize $f(x)=x^3-60x^2+900x+100$

subject $to$

$,0x31$

Suppose that the variable $x$ is restricted to be an integer.

Perform the initialization step and two iterations of the basic genetic algorithm by hand.