Let a function f$($x$)=$ x$-(016)$ be defined on the initial population as $[8,10,12,13]$ while

taking $5-$bit binary representation. Apply a genetic algorithm to determine the maximum

number of given functions while considering the population size of $4.$ Suggest an evaluation

order for the next iteration and populate the next iteration with only the two best

chromosomes from the first iteration. Further, perform the following operations from the

results of the I$\text{'}$ iteration of chromosomes:

a$)$ Single$-$point crossover after the $3$rd gene for two fittest chromosomes.

b$)$ Mutation of the last gene for the worst two chromosomes.

c$)$ Calculate the fitness of new population generated using $($a$)$ and $($b$)$ and find the best fit

chromosome.