Question $4-20$ pts

Why is depth$-$limited minimax sometimes preferable to minimax without a depth limit$?$

$($a$)$ Depth$-$limited minimax can arrive at a decision more quickly because it explores fewer states

$($b$)$ Depth$-$limited minimax will achieve the same output as minimax without a depth limit$,$ but can sometimes use less memory

$($c$)$ Depth$-$limited minimax can make a more optimal decision by not exploring states known to be suboptimal

$($d$)$ Depth$-$limited minimax is never preferable to minimax without a depth limit

Question $5-20$ pts

Consider the Minimax tree below, where the green up arrows indicate the MAX player and red down arrows indi$-$

MIN player. The leaf nodes are each labelled with