📝 **Question:** Implement `dijkstra(graph, src)` returning the dict of shortest distances. Graph format: `{node: [(neighbor, weight), ...]}`. Run on `{'A':[('B',1),('C',4)],'B':[('C',2),('D',5)],'C':[('D',1)],'D':[]}` from 'A'. Print result sorted by key. 📋 Pick the right answer. 💡 **Hint:** Re-read the theory above if unsure.