Solve the question by showing every possible steps

Need within 20 mins or Disliked!!!!

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 D 7 1 N 2 4 F 12 10 U E 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. b) Explain how the choice of different data structure affect the time complexity of Dijkstra's algorithm. Suggest the circumstances when you should prefer one data structure over the other. c) Write down an algorithm to check whether a directed, weighted graph contains a negative weighted cycle or not. Find the time complexity of this algorithm