Generate the A$*$ search tree $($using tree search$)$ starting with the following start state for depth up to $3$ or until the goal state is

reached, whichever is earlier.

Page $(2/2)$

W B W B B W

$3$Marks for : Annotate each node and edges with appropriate values f$($n$),$ h$($n$)$ and g$($n$)$ for better understanding. A search tree

without such annotations will not get full credit here.

$(2-$d$)$ Argue formally the optimality of the solution obtained.

Valid argument $-2$M$,$ Good attempt in right direction $-1$M

$(2-$e$)$ Will the solution obtained be different if the heuristic is also consistent in addition to being admissible. Why or why not?