Use alpha$-$beta pruning with minimax algorithm on the given tree to find the best move fre the

$10$

MIN player in the given situation. You can write the value on the tree itself. You must clearly identify which move the MIN player should take.