Question: Consider a Directed Acyclic Graph $($DAG$)$ with $n$

number of nodes. The nodes are numbered from $0$ to $(n-1).$ Write

a program that returns a list, which contains all the nodes in

ascending order. Here, list$[$i$]$ contains all ancestors in ascending

order, for the $i^t$ node, and $0i(n-1).$ A node $u$ is an ancestor

of another node $v$ if $u$ can reach v via a set of edges. For example,

consider the following graph. The Output for this graph should be:

$\left[\begin{array}{ccccc}?& ?& ?& ?& ?\\ ?& ?& ?& ?& ?\\ ?& ?& ?& ?& ?\\ 0& 1& ?& ?& ?\\ 0& 2& ?& ?& ?\\ 0& 1& 3& ?& ?\\ 0& 1& 2& 3& 4\\ 0& 1& 2& 3& ?\end{array}\right]$

Explanation:

Nodes $0,1,$ and $2$ do not have any

ancestors.

Node $3$ has two ancestors $0$ and $1.$

Node $7$ has four ancestors $0,1,2$ and $3.$

Special instructions:

$.$ Test your code for these following graphs. Finally, attach a screenshot from your output

console$/$terminal$.$