Using the following algorithm below develop software to:

Algorithm General Search

Open$\_$states.insert $($Initial$\_$state$)$

Current$=$ Open$\_$states.first$()$

while not is$\_$final$($Current$)$ and not Open$\_$states.empty$()$ do

Open$\_$states.delete$\_$first$()$

Closed$\_$states.insert$($Current$)$

Successors$=$ generate$\_$successors$($Current$)$

Successors$=$ process$\_$repeated$($Successors$,$ Closed$\_$states,

Open$\_$states$)$

Open$\_$states.insert$($Successors$)$

Current$=$ Open$\_$states.first$()$

eWhile

eAlgorithm

$1.$ Write$/$develop a software program using any programming language to

simulate $8$ puzzle problem $($Game$)$;

$2.$ Write$/$develop a software program using any programming language to

simulate XOR problem $($tic tac toe$).$