Explain how to use depth first search to compute the number of children every node has in a directed acyclic graph (DAG). We say that node v is a child of node u if u is on on the path from the root to v.