In a $0-1$ integer programming model, if the constraint $x2-x3=0,$ it means when project $2$ is selected, project $3$ be selected.

A$)$ can sometimes

B$)$ must also

C$)$ can also

D$)$ can never