Read about Dijkstra Algorithm from this link and others if needed and answer the following questions: 1. What is the input to this algorithm? (1 marks) 2. What is the output of this algorithm (1 marks)? 3. What are the possible benefits or application areas of this algorithm? (2 marks, the better the explanation the more the marks) 4. Write down the its algorithm and explain how it works (1 mark) 5. Apply the algorithm on the below graph, showing each intermediate step as a new his drawing (3 marks) 3 2 2 8 6 3 8 1 8 5 6. What would be a good data structure to implement sptSet. Hint: look into the algorithm of Prims to calculate Minimum Spanning tree as discussed in class (2 marks)