Trace the Dijkstra's weighted shortest path algorithm on the graph given in Figure 1. Use vertex E as your start vertex. Trace the breadth-first search traversal algorithm on the graph in Figure 1 starting from vertex E