Suppose that you want to implement an algorithm tht will compete on a two-player deterministic game of perfect information. Your opponent is a supercomputer called DeepGreen. You do not know what algorithm DeepGreen uses. You are given a library function DeepGreenMove(S), that takes any state S as an argument, and returns the outcome of the move that DeepGreen will choose for that state S (more precisely, DeepGreenMove (S) returns the state resulting from the opponent's move). Write an algorithm in pseudocode (following the style of the Minimax pseudocode) that will always make an optimal decision given the knowledge we have about DeepGreen. You are free to use the library function DeepGreenMove(S) in your pseudocode. How does this compare to Minimax wrt optimality of solution and the number of states explored.