Problem 2: allPathsA graph isacyclicif there is no cycle in it.Given adirected acyclic graph (DAG)(with at least one edge) and two verticesv,uin the DAG, find allpossible paths fromvtou.The input graph is represented as a Python list of all edges in the graph. Each edge is a pair(u,v)whereuandvindicating there is an edge from vertexuto vertexv.Note:A path is represented as an ordered Python list of vertices[v1, ...,vn]such that for each 1in1, there is an edge fromvitovi+1.The order of the possible paths in the output does not matter.The return type is a Python list of Python lists.This problem is to get you familiar with graphs. You do not have to use dynamic programming toimprove its time complexity.

def allPaths(edges, source, destination):

Problem 2: allPaths A graph is acyclic if there is no cycle in it. Given a directed acyclic graph (DAG) (with at least one edge) and two vertices o, u in the DAG, find all possible paths from v to u. The input graph is represented as a Python list of all edges in the graph. Each edge is a pair (u, v) where u and v indicating there is an edge from vertex u to vertex v. Note: A path is represented as an ordered Python list of vertices (01,..., Un] such that for each 1