Q$4.$ Consider the search tree shown below in a game played using Min$-$Max algorithm. Which of these

nodes does not need to be computed to r$.$ it the searr.h snaree:

$($a$)$ C

$($b$)F$

$($c$)$ D

$($d$)E$

$($e$)$ None of the above.