The minimax tree above shows all possible outcomes of the RED$-$BLUE game. In this game, Min plays first, then Max, then Min. Each player, when it's their turn, chooses either a blue stone $($B$)$ or a red stone $($R$).$ Leaf nodes have evaluation values

$.$ Assume that search proceeds from left to right, e$.$g$.,$ leaf node a is evaluated before leaf node b$.$ Assume that we are using alpha$-$beta pruning. Of the eight leaf nodes, which ones will be pruned using alpha$-$beta pruning?

$($a$)$

Only nodes g and h

$($b$)$

Only nodes d$,$ g$,$ and h

$($c$)$

Only nodes d and

h

$($d$)$

None