The game tree in Figure below is limited to depth 3. The evaluation function (utility) values at this level are indicated. Assuming that the player at level O is MAX, at level 1 is MIN, at level 2 is MAX and at level 4 is MIN, perform the following algorithms Minimax Left-to-right alpha-beta pruning. Right-to-left alpha-beta pruning. * For the two alpha-beta pruning, indicate the direction you are taking, the alpha and beta values at the nodes ([?, ?), and exactly which branches are pruned off. The game tree in Figure below is limited to depth 3. The evaluation function (utility) values at this level are indicated. Assuming that the player at level O is MAX, at level 1 is MIN, at level 2 is MAX and at level 4 is MIN, perform the following algorithms Minimax Left-to-right alpha-beta pruning. Right-to-left alpha-beta pruning. * For the two alpha-beta pruning, indicate the direction you are taking, the alpha and beta values at the nodes ([?, ?), and exactly which branches are pruned off