3 Consider the following graph: -- 2 1 A B D 8 6 6 2 1 4 E F G 5 1 H 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 chosen. You must clearly mention what data structure options do you have to implement the algorithm you chose and what would be the time complexity of the algorithm for each of the choices. Explain clearly. 5 marks