Quiz: Path Query Updates

In the path queries problem using the entry-exit Euler tour, you update node $v$'s value by adding $d$. Which positions in the array do you modify?

1. A.Only tin[v]
2. B.All positions from tin[v] through tout[v]
3. C.tin[v] with $+d$ and tout[v] + 1 with $-d$
4. D.All positions from $0$ to tin[v]