Consider the graph below illustrating 20 independent runs of a basic hill chmbing algorithm for solving a maximisation problem Each line depicts a single run, showing the objective value (vertical axs) agaunst the iteration number of the algorithm (horizontal axis) (a) Explain why the lines of the runs have different lengths (b) Can you deduce the approximate objective value of the optimal solution from the graph? Explan your answer (c) Discuss what you can observe about the nature of the problem from the graph (d) Use the graph to explain how iterated local search can partially address the problem of (3) local optima (e) How do you expect the lines to change if a steepest-ascent hill climber was used instead of a basic hill chmbing algorithm? Explain your answer (f) Will the use of a steepest-ascent hill chmber be more computationally intensive than a basic hull chmber? Explain your answer (g) How do you expect the hines to change if a simulated annealing approach was used instead of a hill climbing algorithm? Explain your