You are given the following graph:

Starting at node D$,$ in which order will the nodes in the graph be visited by Breadth First Search $($BFS$)?$

Note: You must use the algorithm that was discussed in this course.

Note: If you encounter a node with multiple neighbors, you should visit its neighbors in alphabetical order.

Note: Order the items such that the first node to be visited is on top, and the last node to be visited is on the bottom. Starting at node D$,$ in which order will the nodes in the graph be visited by Breadth First Search $($BFS$)?$

Note: You must use the algorithm that was discussed in this course.

Note: If you encounter a node with multiple neighbors, you should visit its neighbors in alphabetical order.

Note: Order the items such that the first node to be visited is on top, and the last node to be visited is on the bottom.

Drag from here:

A

B

C

D

E

F

G

H

Construct your solution here:

PLZ PLZ PLZ don't answer it from ChatGPT PLZ and this is my last chance and PLZ again don't answer it from ChatGPT!!!!!!!!