Consider the minmax with alpha$-$beta pruning algorithm when run on this tree starting from the root $($expanding nodes left to right$).$ Answer the following questions. Show your work for full credit $($can upload an image file$).$

What nodes$/$subtrees will be pruned $?$

What are the values of alpha and beta at state A when it returns $($i$.$e$.,$ the algorithm ends$)?$

What are the values of alpha and beta at state B when it returns?

What are the values of alpha and beta at state C when it returns?

What is the minmax utility of state A$?$

What is the optimal action at A$?$