HELP i need the solution for this Java program

HELP i need the solution for this Java program and the hole code and the program as soon as possible :implement a simple GA with fitness-proportionate selection, roulettewheel sampling, population size 100, single_point crossover rate pc = 0.7, and bitwise mutation rate pm=0.001. tray it on the following fitness function: f(x) = number of ones in x, where x is a chromosome of length 20. perform 20 runs, and measure the average generation at which the string of all ones is discovered.
perform the same experiment with crossover turned off (i.e.,pc=0). do similar experiments, varying the mutation and crossover rates, to see how the variation affect the average time required for the GA to find the optimal string . if it turns out that mutation with crossover is better then mutation alone, why is that the case?