In the adversarial search shown below, if Player $1$ initially selects the move leading to a

$0$ position value $($the right$-$hand branch$),$ what is the maximum score Player $1$ can

achieve?

a$.-2$

b$.3$

c$.2$

d$.0$