QUESTION 1 A local search algorithm will work with how many paths in it's search? As many as the frontier can handle. One path per thread. None, local search algorithms only ever consider adjacent nodes. Two, if using a bidirectional search algorithm. QUESTION 2 Which of the following hill climbing algorithms is complete because it will never get stuck at a local maxima? first choice hill climbing random-restart hill climbing steepest-ascent hill climbing stochastic hill climbing QUESTION 3 A genetic algorithm is a type of stochastic search. True - False QUESTION 4 Algorithms used to find contingent solutions for nondeterministic problems require how many types of nodes? 2 QUESTION 5 These types of search algorithms find their solution before actually interacting with the real world. dynamic offline online continous