Adversarial Search

Consider the game tree above: $($a$)(4$points$)$UsetheMinimaxalgorithmtocomputetheminimaxvalueateachnodeforthegame tree. $($b$)(10$points$)$ Show the application of alpha$-$beta pruning on the same game tree expanding successors from left to right. Indicate where the pruning occurs with an X$.$ Also, record the $[]$pair for each node when first visited$($to the left of the node$),$ then final values$($to the right of the node$).($c$)(10$points$)$Repeat$($b$)$expanding successors from right to left.