Consider using A$*$ search to find the best way to travel from Arad to Bucharest using the below map and line heuristic. List the correct$-$ordered and complete sequence of cities to be evaluated and their corresponding evaluation function values f$($n$).$ Please provide a handwritten solution with detailed steps