Q$7.$ Apply GA for only one cycle to a numerical maximization problem

Maximize $sin(x)$

Variable bound $0x2$

Use four bit strings to represent the variable $x$ so that string $(0000)$ represents value $0$ and string

$(1111)$ represents value $2.$ The other $14$ strings are mapped in the range $(0,2),$ uniformly. Let us assume

population size is four and initial population selected randomly is $(0110,1010,0101,1101).$ Take

proportional selection and single point crossover operator and no mutation.