Using the genetic algorithm Python code base provided as a starting point, implement a genetic algorithm

to solve the knapsack problem. Please address the following by including the associated Python code

excerpts $($as appropriate$)$ and explanation of the code in the PDF file:

$$ createChromosome$()$ logic

$$ crossover$()$ logic

$$ Logic to compute chromosome fitness, e$.$g$.,$ any modifications to the evaluate$()$ function

$$ rouletteWheel$()$ logic

$$ mutate$()$ logic

$$ insert$()$ logic

Apply the technique to the random problem instance and determine the best solution and objective value

using your revised algorithm. Test multiple versions of the GA $($e$.$g$.,$ different number of generations,

population sizes, crossover rates, etc