Consider the following state$-$space graph where the arcs represent the legal successors of a node. The cost of

moving to a successor node is given by the number on the arc. The value of a heuristic evaluation function and $h$

is shown below the node. Given that the start state is a and the goal node is z$.$ Select the list of visited nodes $($in

order$)$ and path after applying breadth search algorithms $[$Note that you must use alphabetical ordering for

uninformed algorithms$]$:

Select one:

a$.$ Visited: abefz, Path: abez

b$.$ Visited: abcefz, Path: abfz

c$.$ The algorithm will enter in a loop.

d$.$ Visited: abcefdz, Path: abez