have you implement a simple genetic algorithm an test it on a simple problem: the onemax problem. Your program has to be general enough so that you can easily modify it in the future to incorporate other fitness functions encoded as binary strings, as well as other crossover and mutation operators. For this assignment you need to implement: 1. 1-one-point crossover 2. 1-bit-flip mutation, 3. Binary tournament selection with replacement, 4. Full replacement. You will be graded based on the correctness of the implementation and on the quality of the code. It is expected that you code according to good programming practices