Assume that we modify the hill-climbing search algorithm given in class, to make it search for the minimum objective value. Given the state-space landscape below, which of the following statements is FALSE for hill-climbing search whose aim is minimization?

Objective function H S Q R A E F G 1 P B D JK N O State L M space If the algorithm starts at point 1, it returns point J as the solution. If the algorithm starts at point H, it cannot find the optimal solution. If the algorithm starts at point A or E, it ends up with the optimal solution. If the algorithm starts at point G, it returns point H as the solution. Optimal solution for this problem is C