Question: Implement and apply the hill-climbing, simulated annealing, and genetic algorithms to maximize function g(x) used in the previous exercise assuming a bitstring representation. Tip: the perturbation to be introduced in the candidate solutions for the hillclimbing and simulated annealing algorithms may be implemented similarly to the point mutation in genetic algorithms. Note that in this case, no concern is required about the domain of x, because the binary representation already accounts for it. Discuss the performance of the algorithms and assess their sensitivity in relation to the input parameters.