Give a linear-time algorithm that takes as input a directed acyclic graph G (V.E) and two vertices a and t, and returns the number of paths from a to t in G. For example, in the following directed acyclic graph, there are exactly four paths from vertex p to vertex t: pov, paryv, pasrye, and psryv. (Your algorithm only needs to count the paths, not list them) (20 marks)

Question\#3: Give a linear-time algorithm that takes as input a directed acyclic graph G (V.E) and two vertices a and t, and returns the number of paths from a to t in G. For example, in the following directed acyclic graph, there are exactly four paths from vertex p to vertex t: pov, paryv, pasrye, and psryv. (Your algorithm only needs to count the paths, not list them) (20 marks)