In each of the cases below, state whether a node can be pruned always, sometimes, or never. Assume that in the expectiminimax game that outcome values are bounded between +1 and -1.

(a) In a minimax game, a leaf node that is the first child of its parent.

(b) In a expectiminimax game, a leaf node that is the first child of its parent.

(c) In a minimax game, a leaf node that is the last child of its parent.

(d) In a expectiminimax game, a leaf node that is the last child of its parent.