Q$.3$ Given the graph below where Arad is the root node and Hiwsoyg is the goal$).$ Demonstrate the search tree by applying the $A^{**}$ algorithm? and what is the final path?

Note: The value of each node according to f needs to be shown in the search tree?

$\backslash$table$[[$straight$-$line distances$],[$to Hirsova,$],[$Arad$,],[$Bucharest$,366],[$Bur$,151$