Quiz: Tarjan's Algorithm Complexity

Tarjan's bridge-finding algorithm runs a single DFS. What is its time complexity on a graph with $n$ nodes and $m$ edges?

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