Question $2$: In this tree problem, apply Greedy Search and A$*$ Algorithms to explore all paths

from the Start to Goal node. After exploring each path, identify and emphasize the optimal

path.

Heuristic Values

$($Estimated Cost$)$

$H(A)=13$

$H(B)=11$

$H(C)=10$

$H(D)=4$

$H(E)=6$

$H(G)=0$

Note: Mention all the possible paths and their total cost in a step by step manner.

Hint:

Greedy Search: We only take Heuristic values in consideration to find the optimal path.

$f(n)=h(n)$

A$*$ Search Algorithm: We take both Heuristic values and Actual Path Cost for finding the optimal

path.

$f(n)=h(n)+g(n)$

$f(n)=$ Evaluation value at the particular node.

$g(n)=$ Total path cost from start node to particular node.

$h(n)=$ The heuristic value of the particular node.