Give a linear-time algorithm that takes as input a directed acyclic graph G = (V, E), and two vertices s, t V and returns the number of different directed paths from s to t in G.