Question$1$:

Create a $0/1$ Knapsack problem by your own. There must be $8$ different products

$($A$-$H$)$ for your problem. You have to carry the different products in your bag in a way

such that the reward is maximized $($set the reward by yourself$)$ without exceeding

the weight limit $($set the weight limit $12).$ You can carry an object exactly once but

you always have to carry the object labeled $"$H$".$ Assuming you are asked to use

Genetic Algorithm for this problem, answer the following questions. $[10]$

Encode the problem and create an initial population of $4$ different chromosomes.

Chromosome length must be $5.$

Explain what would be an appropriate fitness function for this problem. Use the

fitness function and perform natural selection to choose the $2$ fittest chromosomes.

Using the selected chromosomes perform a single$-$point crossover to get $2$

offspring.

Perform mutation and check the fitness of the final offspring. Explain your work.