There are three starting nodes, namely $"$A$","$B$"$ and $"$C$",$ and one finish node, namely"F$".$ Apply greedy best$-$first search in order to move from each starting node $("$A$","$B$"$and $"$C$")$ to the same finish node $("$F$"),$ namely find the paths from $"$A$"$ to $"$F$",$ from $"$B$"$to $"$F$",$ and from $"$C$"$ to $"$F$".$ If multiple alternative nodes are available at any step, yourchoice should be based on alphabetical order. For each starting point $("$A$","$B$"$ and"C$"),$ provide