Search in a graph Consider the following graph with start state $\backslash ($ S $\backslash )$ and goal state $\backslash ($ G $\backslash ).$ The numbers on $2005$ peritive the arcs indicate the cost of traversing that arc Tie breaking in search is based on the alphabetical order of the node nande, Ce ini. solution path to the gaal the order of A$,$ B$,$ C$.$ SCABG $$FBG