3 Consider the following graph: 1 A B D 8 6 2 1 E F 5 G ( Suppose, you are given the task to determine the shortest path from the source vertex A to any other vertices in the given graph. a) Which algorithm would you prefer and why? 5 marks 10 marks b) Determine the shortest path from A to H using your preferred algorithm. Show your steps carefully. c) Explain what would be the time complexity of the algorithm that you have 5 marks