Which of the following statements are true for Minimax strategy?The challenge for the Minimax strategy is the exponential time complexity in obtaining minimax values for the game tree.It proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree.It uses DFS with a simple recursive computation of the minimax values of each successor state.The challenge for the Minimax strategy is the exponential space complexity in obtaining minimax values for the game tree.