(A) (3 pts.) Using the tree below, give the result of the minmax algorithm assuming that the root holds a MAX value. (B) (3 pts.) Using the same tree below, give the result of the minmax algorithm assuming that the root holds a MIN value. (C) (3 pts.) Repeat problem (A) using alpha-beta pruning. (D) (3 pts.) Repeat problem (B) using alpha-beta pruning 18 3 9 -12 -18 10 112 123 12 1 9 -13 13 7 910-19-106 997 8-130