** unsider the following game tree for two-person game, in which the utility values for leaf nodes are given. Assume root node as MAX node. MXT MN e 8e=6{e=7e=5 MX e=9 e=2 e 3 e=2) [e 4 e=8 e=10 e= 2...

Subject is machine learning please do by hand only not by coding it's simple question of min max and pruning please do with explanation I'll upvote

Extracted text: ** unsider the following game tree for two-person game, in which the utility values for leaf nodes are given. Assume root node as MAX node. MXT MN e 8e=6{e=7e=5 MX e=9 e=2 e 3 e=2) [e 4 e=8 e=10 e= 2 e=0 (e=5 (e=6 Find the overall best move for the MAX player using the minimax algorithm. Indicate each intermeciate node's value properly. Apply alpha-beta pruning to identify the pruned branches in above game search tree. Indicate where the cutoffs occur. Illustrate the updating progress of best node value, alpha and beta values at each node while applying alpha-beta pruning. i. ii. 3.