Enter your answer O For the given Graph show the final routing Table for Node E, when using Dijkstra algorithm? (Hint: If the cost are equal we use Alphabet Order, that is, cost to A=5 and cost to B=5, her the cost are equal, for that we choose A) YOU need to show all your work to get any credit. Such that show the permenant and tentaive list in each iteration, and finaly the the Routing Table for E. (15 Points) Enter your