Using A search algorithm to solve the Eight Puzzle problem. Please answer the questions Set of operators: uarr,darr,$,$larr

$D(2+4=6)$

$A(1+3=4)$

$E(2+5=7)$

S $(0+5=5)$

$H(3+3=6)$

$1(4+2=6)$

$K(5+0=5)$

Question:

Explain what the expression $A(1+3=4),B(1+6=7),C(1+6=7)$ means

Explain what the expression $K(5+0=5)$ means

Why the A search choose A route for the nextlevel search $($From $AD,E,F)$

Discuss the advantages and disadvantages of heuristic search comparing with blind

search

based on the following conditions?

The heuristic function is defined as $f(n)=g(n)+h(n)$

$g(n)$ : The depth of node $n,$ such as $g(S0)=0.$

$h(n)$ : The number of positions $($including empty space$)$ where node $n$ differs from the

target state, also known as 'out$-$of$-$place' count. For example, $h(S0)=5$

Initial state $S_0$

Goal state