Searching algorithms

Consider the following graph The number in the graph shows the distance between two states.

A$.$ Use uniform cost search to find the shortest path from J to A$.$ Complete the following table to

show the expanded state and the frontier in each round. You can add more rows if needed.

The first two rows are already given.

B$.$ Based on your results in the table of $($a$),$ give the shortest path from $J$ to $A.$

C$.$ The heuristic value table is given as follows. Value $h(n)$ is the heuristic value for each state $n.$

Run tree$-$search A$*$ algorithm to find a path from J to A$.$ Draw the search tree with the node

you expand and give the $f(n)$ and $g(n)$ values for each node generate during your search.