Design an algorithm that takes as input a directed acyclic graph G (V,E) and two vertices s and t, and returns the number of simple paths from s tot in G. For example, the directed acyclic graph below contains exactly four simple paths from vertex p to vertex v: pov, poryv, posryv, and psryv. Your algorithm should run in time O(V E). Write the pseudocode and analyze the running time. (Your algorithm needs only to count the simple paths, not list them. Also, a correct algorithm that runs slower but with correct runtime analysis will be given partial credit.) 0