Consider a best$-$first search algorithm in which the evaluation function is f$($n$)=(2$w$)*$g$($n$)+$w$*$h$($n$).$ For what values of w is this complete? For what values is it optimal, assuming that h is admissible? What kind of search does this perform for w$=0,$ w$=1,$ and w$=2?$