In a game playing search tree, upto which depth $\alpha-\beta$ pruning can be applied?
(A) Root $\text{(0)}$ level
(B) $6$ level
(C) $8$ level
(D) Depends on utility value in a breadth first order
Choose the correct answer from the options given below :
- $\text{(B)}$ and $\text{(C)}$ only
- $\text{(A)}$ and $\text{(B)}$ only
- $\text{(A)}$ $\text{(B)}$ and $\text{(C)}$ only
- $\text{(A)}$ and $\text{(D)}$ only