Question $3$

In what way does $A^{**}$ search differ from uniform$-$cost search? $q,$

A$*$ search always expands the node with the lowest cost.

$A^{**}$ search uses a heuristic function to guide the search.

$A^{**}$ search uses hash tables.

$A^{**}$ search guarantees completeness.