a$)$ Use minimax algorithm on the given tree to find the best move for the MAX player in the given Code: $xyx.$ situation. You can write the value on the tree itself. No need to use alpha$-$beta pruning. You must clearly identify which move the MAx player should take.

$$ represents the max node. grad represents the min node.

b$)$ In adversanal search, why do we need to cut ott scarch and app$\text{'}$ a neuristic evaiuanon runction: Explain your answer, with examples$/$diagrams if possible.