Adversarial Search

These questions refer to the game tree below

Using alpha$-$beta pruning $($and standard left$-$to$-$right evaluation of nodes$),$ list all the nodes that will be pruned in alphabetical order, separated by

spaces $($e$.$g$.,"$A B$\text{'}).$ Put $"-"$ if no nodes will be nnuned

List the nodes that lie on the winning path, in top$-$down order, separated by spaces.

Using alpha$-$beta pruning $($and standard right$-$to$-$left evaluation of nodes$),$ list all the nodes that will be pruned in alphabetical order, separated by

spaces $($e$.$g$.,"$A B$\text{'}).$ Put $"-"$ if no nodes will be pruned.