SITE A short road race has been organized by for final year students. Students have to start at point A and use their own choice of route to reach endpoint E as quickly as possible. Figure 4 shows the network of roads available and, for each road, the minimum completion time in seconds, for a student in Mira, the best girl runner in is planning her strategy. Given that she can run each section in the minimum time, use Dijkstra's algorithm to find the route she should take. State her time for the race and draw the route. Show all your workings for each iteration in a table. 20 A B B 20 10 5 8 30 D 4 92 C 00 35 20 40 11 F F E) Figure 4