Given a directed acyclic graph of N nodes. Find all possible paths from node 0 to node N-1, and…
N
0
N-1