We define First$-$Choice Hill Climbing $($FCHC$)$ as a stochastic hill$-$climbing algorithm that generates neighbours randomly until one is found better than the current state. When this happens, the algorithm moves to this new state and repeats.

Select the CORRECT statements:

FCHC is similar to Simulated Annealing for large values of T$.$

FCHC will always return the same solution as Greedy Hill Climbing as we always take a step in the direction of increasing slope.

FCHC will perform better than Greedy Hill Climbing when each state has a large number of neighbours.

FCHC combined with Tabu List does not suffer from local maximas$/$minimas$.$