3.6. Consider the genetic mapping data described in Problem 3.5.

a. Apply a genetic algorithm to estimate the genetic map (i.e., the ordering and the genetic distances). Use the order crossover method. Begin with a small run to gauge the computational difficulty of the problem, then report your results for a run using reasonable limits on the computational burden. Comment on your results, the performance of the algorithm, and ideas for improved search.

b. Compare the speed of fitness improvements achieved with the order crossover and the edge-recombination crossover strategies.

c. Attempt any other heuristic search method for these data. Describe your implementation, its speed, and the results.