Question 4: Local Search.... .....15 points Circle the correct answer: 1. The solution found by simulated annealing depends on the initial state. [ True, False ] 2. Simulated annealing finds the optimal solution, if the probability of accepting abad move is approaching 1. [ True, False ] 3. The number of steps in simulated annealing depends only on the temperature schedule. [ True, False ] 4. The number of steps in local beam search depends on the objective function. [True, False ] 5. Local search algorithms consume less memory than uninformed search algo- rithms. [ True, False ] 6. Local beam search is not guaranteed to find an optimal solution. [ True, False) 7. Simulated annealing consumes less memory than local beam search [ True, False ]. 8. Local beam search with k = 1 is equivalent to hill-climbing [ True, False ). 9. Simulated annealing may sometimes find a local optimum only [ True, False ]. 10. Simulated annealing with constant temperature T = 0 at all times and ignoring the termination test, is equivalent to stochastic hill-climbing [ True, False)