Inclass Ex $4$

Given the following graph $($think$,$ it is the map of Romania!$)$

If the initial state is A and the goal state is $F$

What is the path returned by running

Greedy best first search. Note that this algorithm

uses an evaluation function $f(n)=h(n)$

A$*$ algorithm. Note that this algorithm uses an evaluation function $f(n)=g(n)+h(n)$

Weighted $A^{**}$ with a weight $=5$ and with a weight $=2.$ Note that this algorithm uses an evaluation

function $f(n)=g(n)+Wxh(n)$

What is the optimal path cost? Which of these algorithms will give us the optimal solution?