QUESTIONS:

The cities, distances between cities, and information about the city from which city to which one can go$,$ are presented in the table below for TAN Airlines. First draw the acyclic graph then find the shortest route by applying the shortest route algorithm from $A$ to $G.(40$ points$)$ where;

$n($j$)$ node $($city$)$ j

$d(j,k)$ distance from city $j$ to city $k$

$,p(j)$ predecessors of city $j$

$\backslash$table$[[d(j,k),$A$,$B$,$C$,$D$,$E$,$F$,$G$],[$A$,$X$,2,4,x,x,x,x$