Show the result of Uniform cost search algorithm on this search tree.

$(2-$b$)$ Is the uniform cost search $($as presented in class and Text Book$)$ a tree search or a graph search? Explain why should it be this

way?

$(2-$c$)$ When the heuristic function h$($n$)>=($ where $$ is a small positive constant$)$ the states expanded by A$*$ algorithm will be a

subset of uniform cost search. Why or why not?

Question $-3[3+2+3+2+1=11$ M$]$

$[$