Consider the minimax tree above with the following values: A:-2, B:12, C:9, D:5, E:12, F:7, G:14, H:-1, I:-4, J:-4, K:5, L:-4, M:12, N:-1, O:6, P:6
Suppose two optimal players, Max and Min, play a game. They take turns trying to maximize and minimize the utility.
If Max is the root, what is the minimax value of the root?