Consider the following graph in which A$,$ B$,$ C$,$ D$,$ E$,$ and F are nodes and

edges are labeled with their respective weights $($distances$).$

You are at node A$,$ and your goal is to reach node F using the A$*$ search

algorithm. You are given the following heuristic distance function $g(n)$ for

each node:

$g(A)=9,g(B)=7,g(C)=3,g(D)=10,g(E)=5,g(F)=0$

Using $A^{**}$ search with both cost and distance as factors in the heuristic

function, calculate the path from node A to node F$.$ Show your calculations

step by step, including the nodes you expand and their respective

heuristic function values. Determine the total cost of the path and the

sequence of nodes visited.