task : consider the following population of binary-encoded solutions being manipulated by a standard evolutionary algorithm for an on-hardware design task (maximisation):

No. Genome---------------Fitness

1. 11111100---------------19037875

2. 11000011--------------40404040

3. 01000010--------------20202020

4. 10001001--------------10909090

a. How might you use such a binary representation evolutionary algorithm with a field programmable gate array?

--------------------------

b. Show a likely population of four parents after selection using the roulette-wheel scheme, indicating why. Contrast with using the tournament selection scheme

-------------------------

c. Show how this parent population might look after crossover using the one-point scheme.

------------------------

d. Show how this parent population might be further changed under mutation.

can anyone help these theories manny thanks !