Write a canonical genetic algorithm to solve the Task allocation problem on java with the following rules:

$1.$ Use a binary, one$-$dimensional chromosome. $2.$ Try the following for the population size. You can try different population sizes $[50,100,250]$ to see how this will affect your results. The maximum number of generations is also up to you. $3.$ To evaluate the chromosome, assign genes with $1$ to core $1$ and genes with $0$ to core $2$ where time taken will be the max between the two. $4.$ Think about how you will handle infeasible solutions. Infeasible solutions are solutions that violate the constraints of the problem; therefore, they are not allowed. $5.$ Use roulette wheel selection $6.$ Use one$-$point crossover. $7.$ Use flip bit mutation $8.$ Elitism replacement $9.$ The output should consist of the test case index, The best solution $,$ it evaluation score, its chromosome representation, the tasks assigned to each core and their total time.