Question $1($a$)-$ Uninformed Search Total $10$ marks Based on Figure: $1,$ answer questions $($i$)$ to $($iii$).$ i$)$ Perform a Breadth$-$First search on the above tree. List the nodes on OPEN and CLOSED for each iteration. S$=$Start, and F$=$ Goal. $[3$ marks $]$ ii$)$ The Breadth$-$First search algorithm can be implemented in a order or with a $[1\mathrm{.}5$ marks$]$Question $1($a$)-$ Uninformed Search Total $10$ marks Based on Figure: $1,$ answer questions $($i$)$ to $($iii$).$ i$)$ Perform a Breadth$-$First search on the above tree. List the nodes on OPEN and CLOSED for each iteration. S$=$Start, and F$=$ Goal. $[3$ marks $]$ ii$)$ The Breadth$-$First search algorithm can be implemented in a order or with a $[1\mathrm{.}5$ marks$]$Question $1($a$)-$ Uninformed Search Total $10$ marks Based on Figure: $1,$ answer questions $($i$)$ to $($iii$).$ i$)$ Perform a Breadth$-$First search on the above tree. List the nodes on OPEN and CLOSED for each iteration. S$=$Start, and F$=$ Goal. $[3$ marks $]$ ii$)$ The Breadth$-$First search algorithm can be implemented in a order or with a $[1\mathrm{.}5$ marks$]$