Question 10 (1 point) Which of the following is true about local search algorithms in general? No local search algorithm can keep track of multiple states and perform search in each of their neighbourhoods. At every step, these algorithms choose a state that is at least at good as the previous state. These algorithms can be used if the solution path is irrelevant. Increasing the neighbourhood size causes these algorithm to get stuck in local optima more often