QUESTION $2(22$ NARKS$)$

Gven the following graph, fill in Table $2$ by performing best$-$first search to find the traress phes trom node A to goal node $K.$

Table $2$ Best$-$First Search

$\backslash$table$[[$Looping$,$Evaluate,Open,Closed$],[,,,]]$