Apply Breadth First Search $($BFS$)$ to find and write the path from A to G$.$ Show the complete process in the table which contains the visited nodes and agenda.

Solution $($Process$)$

$\backslash$table$[[$Visited Node,Agenda$],[,],[,],[,],[,],[,],[,],[,],[,],[,],[,],[,],[,]]$