Convert the genetic algorithm example of searching within a volume for the point that maximizes an evaluation function into a hill-climbing problem, implement the solution, and compare it to the time...

Convert the genetic algorithm example of searching within a volume for the point that maximizes an evaluation function into a hill-climbing problem, implement the solution, and compare it to the time required for an equivalent-accuracy genetic algorithm solution: 1. As a sequential approach, and 2. As a parallel approach.