Given oriented weighted graph G=(V;E) where V={A;B;C;D;E}, E={(A,B,w=10); (A,D,w=13); (B,C,w=6); (B,D,w=2); (D,C,w=3); (D,E,w=5); (C,E,w=1)}. What sequence of vertices is on the shortest path from vertex A to vertex E and what is the length of that shortest path (length of path is the sum of weights)?