(b) Explain, using diagrams as appropriate, why Dijkstra's algorithm for finding the lowest cost path through a weighted graph is an example of a greedy algorithm. Your answer should include the key concept of an invariant. [5 marks)