Q12 Early Goal Checking Graph Search Recall from lecture the general algorithm for GRAPH-SEARCH reproduced below.With the above implementation a node that reaches a goal state may sit on the fringe while the algorithm continues to search for a path that reaches a goal state. Let's consider altering the algorithm by testing whether a node reaches a goal state when inserting into the fringe. Concretely, we add the line of code highlighted below:Now, we've produced a graph search algorithm that can find a solution faster. However, In doing so we might have affected some properties of the algorithm. To explore the possible differences, consider the example graph below.Q12.1 If using EARLY-GOAL-CHECKING-GRAPH-SEARCH with a Uniform Cost node expansion strategy, which path, if any, will the algorithm return?
A、S-G
B、S-A-G
C、EARLY-GOAL-CHECKING-GRAPH-SEARCH will not find a solution path.
D、(无)