Question: Use the following graph $($A is the start state and G is the goal state$)$ to find the path and the lenght of path

:

State h$($n$)$

A $24$

B $16$

C $15$

D $13$

E $13$

F $10$

G $0$

$1)$Using Best Firs Search where f$($n$)=$ h$($n$)$

$2)$Using Branch and Bound where f$($n$)=$ g$($n$)$

$3)$Using A$*$ search where f$($n$)=$ g$($n$)+$ h$($n$)$