Computer Science Algorithm BFS search quiz question:

I will give thumb up, thank you!

Suppose you use breadth-first search to find a path from state cto state e. Assume that states are added to the queue in alphabetical order (i.e., if we are expanding state 8, we would add fto the queue, then add k to the queue) and we keep track of visited states so we do not backtrack. In what order are the nodes generated? That is, in what order are the nodes put onto the queue representing the frontier? (include cand e in your answer) Select one: o c-b-f-a-d-e-8-j-k-h-i-m-/ c-b-a-d-h-i-e c-b-f-a-d-e c-b-e