Quiz: Tarjan's Low-Link Values

In Tarjan's algorithm, node $v$ has disc[v] = 5 and low[v] = 5. What does this mean?

1. A.Node $v$ was the $5$th node discovered and is the root of its SCC
2. B.Node $v$ has exactly $5$ nodes in its SCC
3. C.Node $v$ is at depth $5$ in the DFS tree
4. D.Node $v$ has $5$ back edges