4.1 Give the name 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). d. Simulated annealing with T- oo at all times. e, Genetic algorithm with population size N = 1