$[10$ Points$]$ There is a knapsack with a maximum capacity of $10$ units, and you have

$4$ items $=(1,2,3,4)$ with corresponding weights $=(2,3,4,3)$ and values $=(8,5,7,2)$ accordingly.

The goal is to select a subset of items that maximizes the total value while not exceeding

the knapsack capacity. Apply Genetic Algorithm to find the solution for this problem. The

parameter values are as follows:

Population size: $4$

Number of max generations: $4$

Number of Crossover Points: $1($randomly$)$

Mutation Probability: $0\mathrm{.}01$

Design an appropriate fitness function to compute the quality of the solution. Write all the

computational steps to solve the above problem.