Which of the following statements are true?(A) Minimax search is breadth-first: it processes all the nodes at a level before moving to a node in next level.(B) The effectiveness of the alpha-beta pruning is highly dependent on the order in which the states are examined.(C) The alpha-beta search algorithm computes the same optimal moves as minimax algorithm.(D) Optimal play in games of imperfact information does not require reasoning about the current and future belief states of each player.Choose the correct answer from the options given below:

• A. (A), (C) only
• B. (A) and (D) only
• C. (B) and (C) only
• D. (C) and (D) only