Short Answer Questions $(16$ pts$)$

$(1)$ Among all uninformed search strategies we studied, which one$($s$)$ can be used to find the optimal solution?

$(2)$ What$$s the major difference between the general tree$-$search algorithm and the general graph$-$search algorithm?

$(3)$ Depth$-$first search is a special case of best$-$first search when f $($n$)=?$

$(4)$ What data structure do we usually use to implement an explored set? Why?

$(5)$ Genetic algorithm with population size N $=1$ results in the following algorithm:

$(6)$ What is the potential problem of steepest hill climbing search?

$(7)$ Please list the three major actions that are being used in a genetic algorithm.

$(8)$ How is temperature used in Simulated Annealing Search?