Present the solution path $($listing the sequence of nodes in the solution, e$.$g$.$

SAG$)$ obtained by employing the following search algorithms to traverse the

tree:

i$.$ Depth$-$first search. $[4]$

ii$.$ Breadth$-$first search. $[4]$

iii. Greedy Best first search. $[4]$

iv$.$ A$*$ Algorithm.