please help with answer and proper explanation

Exercise 4 (Shortest Paths in Acyclic Graphs) 10 bonus points Let G=(V,E,w) be a directed acyclic graph (that is, G does not contain a directed cycle). Given a vertex sV, compute the shortest path distances from s to all other vertices in G in time O(n+m). Hint: First compute a topological ordering of the vertices using DFS (see the previous lecture). Then compute the shortest paths using dynamic programming