Question $2$: Alpha$-$Beta pruning $($Part $2)$

Consider the game tree shown below, which is very similar to the previous one but with some reordering of the leaf nodes. Green nodes represent choices for the maximizing player; red nodes represent choices for the minimizing player. The number at each leaf indicates the value a static evaluation function would return if it was computed. Select the leaves that DO NOT NEED to be created and evaluated thanks to the alpha$-$beta pruning. You may want to use scratch paper for convenience.

A

B

C

D

E

F

G

H

I

J

K

L

M

N

O

P

Q

R