Make sure the slution tis tue or no$,$ if it's not true solve the solution,

Given the following information for Romania Problem, apply both greedy and A$*$ algorithm to show how move from Dobreta to Bucharest. Show the advantages and disadvantages of each algorithm.

$\frac{10}{13}$

$\backslash$table$[[,$Advantages,Disadvantages$],[\backslash$table$[[$Greedy$],[$Algorithm$]],\backslash$table$[[-$ Generally easier to write as$],[$well as explain and$],[$implement hence it has less$],[$time complexity.$],[-$ can be used for finding$],[$close to optimization in case$]],\backslash$table$[[-$The local optimal$],[$solution is not always$],[$globally optimal because$],[$it may take long path$],[$while there are other$],[$shortest paths.$]]],[$A$*$ Algorithm,$\backslash$table$[[-$Give the optimal solution,$],[$By calculating path cost$],[$from the start node to current$],[$node$.],[-$Used to solve very complex$],[$problems$.]],\backslash$table$[[-$High complexity of$],[$implementation$.],[-$Memory consuming$],[-$ Has complexity$],[$problems as spend of$],[$executions highly$],[$depends accuracy of$],[$heuristics$.]]]]$