$-$Which nodes will be pruned by alpha beta pruning for the followine figure $($max on top$)$:

A$)$ I

B$)$

If you convert $P=>(QR)$ to Conjunctive Normal Form you get:

$($A$)(-PvvQvvR{)}^{{?}^{?}}(-PvvQvv-R)$

$($B$)(PvvQvvR{)}^{-PvvQvv-R}$

$($C$))=(QvvR$

$($D$)(-Pvv-Qvv-R{)}^{{?}^{?}}(Pvv-Qvv-R)$

How many solutions are there for the following CSP where we want to color all nodes using three available colors without having two adjacent nodes with the same color:

A$)6$

D$)12$

The space complexity of the depth limited search algorithm is:

A$)b^d$

B$)b^{**}1$

C$)b^{\text{'}}$

D$)b^{**}m$

E$)b**d$