Consider a DAG with $d=3.$ Each node except the leaves has $9$ children, and each node except the root and its children has $9$ incoming edges. The children of the root have only one incoming edge. How many leaves does this DAG have?

a$.9$

b$.729$

c$.820$

d$.27$

e$.1$

f$.$ None of the other answers

Consider a DAG with $d=3.$ Each node except the leaves has $13$ children, and each node except the root and its children has $13$ incoming edges. The children of the root have only one incoming edge. How many nodes

does this DAG have?

a$.40$ nodes

b$.53$ nodes

c$.182$ nodes

d$.39$ nodes

e$.$ None of the other answers