Conceptual type : must be comprehensive $($at least half a page$)$ covering all the

relevant points

$1$a$.$ Explain the differences between greedy best$-$first search and $A^{**}$ algorithm.

$1$b$.$ Explain $-$ pruning using a simple example.

$1$c$.$ Explain of trees needed in chance games. Assume that two players are tossing a coin

with a fair coin. Build a schematic of the corresponding game tree.