Quiz: Backward Induction

You run backward induction on a game DAG with $n$ positions and $m$ edges. What is the time complexity?

1. A.$O(n^2)$
2. B.$O(n \cdot m)$
3. C.$O(n + m)$
4. D.$O(m \log n)$