36. Which of the following statements are true?
(A) Depth-first search is identical to the closed list in Graph search.
(B) Alpha-beta pruning is used to calculate the feasibility of whole game tree.
(C) Alpha-beta pruning can be applied to trees of any depth and it is possible toprune entire subtree rather than leaves.
(D) The minimax search is depth-first search, and therefore at one time we justhave to consider the nodes along a single path in the tree.
(E) The minimax decision is dependent on the pruned values.