1 The diagram below shows a weighted, directed graph indicating how you can travel from one site to another site of a museum. 9 B 7 2 4 12 10 10 marks a) The vertices represent the different sites in the museum whereas the edges represent the average time to travel from one site to another. Use the Dijkstra's algorithm to compute the shortest time and hence the path from A to all the other sites. Show your workings clearly