(3.1a) Two-player zero-sum game tree; Node 1 is the root and…

(3.1а) Twо-plаyer zerо-sum gаme tree; Nоde 1 is the root and it is Max’s turn; nodes are expanded left to right. Node 1 (Max) -> Node 2, Node 3. Node 2 (Min) -> Node 4, Node 5. Node 3 (Min) -> Node 6, Node 7. Node 4 (Max) -> leaves 3, 14. Node 5 (Max) -> leaves 4, 16. Node 6 (Max) -> leaves 12, 2. Node 7 (Max) -> leaves 1, 5.Using minimax, what is the minimax value of NODE 3? (Enter a number.)