$2.$ Special Cases of Local Search Algorithms Give the name or a brief description of the algorithm

that results from each of the following special cases

$($a$)$ Local beam search with k $=1.$

$($b$)$ Local beam search with one initial state and no limit on the number of states retained.

$($c$)$ Simulated annealing with T $=0$ at all times $($and omitting the termination test$).$