Problem $3$

$($a$)$ Consider the following search tres, where each are is labelled with the cost of the corresponding

operatoc, and the lesver ars bbelied with the value of a heuritic finction, h$.$ For uninformod searches,

assume children are expanded let to right. In ease of ties, expand in alphabetical onder.

Which node will be expanded next by each of the following search methods?

Depth$-$Furst Search

$2$ Greedy Best$-$Ftrst Search

$3$ Uniform$-$Cost Search

$4$ A$*$ Search