Figure 3 shows a network of roads between towns. The number on each arc represents the length of the road in km. Figure 3 Shiv lives in town A and works in town J. a Complete Figure 4 using Dijkstra’s algorithm to find the shortest route from A to J. State your shortest route and its length. (6 marks) Figure 4 b Explain how you determined the shortest route from your labelled diagram. (2 marks) The route from C to F will be closed for repairs on Wednesday. c Find the shortest route for Shiv from A to J avoiding CF and state its length. (3 marks) d On another day, Shiv needs to collect her dry-cleaning from town, I, on her way to J. Find the shortest route that includes I and state its length. (