Quiz: Counting Paths

You're counting paths from node $1$ to node $n$ in a DAG. Node $v$ has incoming edges from nodes $a$, $b$, $c$ with path counts $5$, $3$, $7$. What's the path count for $v$?

1. A.$\min(5, 3, 7) = 3$
2. B.$5 + 3 + 7 = 15$
3. C.$5 \times 3 \times 7 = 105$
4. D.$\max(5, 3, 7) = 7$