Q$3.$ Consider that you are playing a game against a computer such that the game search tree is as shown

below and your turn is next where you are trying to maximize utility. Then the path that will be selected by

you and the computer while playing this game is:

$($a$)$ ACGO

$($b$)$ ABEJ

$($c$)$ ABDH

$($d$)$ ACFL

$($e$)$ None of the above