Given the following game tree and assuming that MAX makes the first move, use the Minimax Search algorithm to: $1.$ Find the moves of MAX that result in the best utility. $2.$ Show the values of MINIMAX at each node, including at the root.