b$.$ Depth$-$first Search $\backslash$& breadth$-$first Search.

c$.$ Greedy Algorithm $\backslash$& A$*$ Algorithm.

d$.$ Optimal solution $\backslash$& local Minimum solution.

$3-$ Given the following information for Romania Problem, apply both greedy and A$*$ algorithm to show how move from $\backslash (\backslash$underline$\{\backslash$text $\{$ Dobreta to $\}\}\backslash )$ Bucharest. Show the advantages and disadvantages of each algorithm.

Romania with step costs in km

$4-$ Using the following figure:

$[..../4$ Marks$]$

a$.$ Clarify the shortest path from A to H using Greedy Algorithm.

b$.$ Does this algorithm introduce optimal solution? Justify your