Using the state graph shown with $9$ states, draw both a Breath First Search tree a and Depth First Search tree and fill in both of their corresponding tables. Will upvote helpful answer that shows the difference between BFS and DFS with respect to the state graph.

BFS$($a$)$ Show complete BFS search three with at least three levels $($root$,1$st$,$ and $2$nd$).$ If multiple nodes are created for same state, say $$f$,$ use f$1,$ f$2,$ f$3,$ etc., to denote each node $($the number corresponding to node being created$).$ Break tie in favor of node with a lower alphabetic order, e$.$g$.,$b$$ has a higher priority than $$c$$BFS$($b$)$ Report the order of the nodes being visited, and the Fringe structure $($report fringe structure of each step as show in the table below$)$

DFS$($a$)$ Show complete DFS search three with at least three levels $($root$,1$st$,$ and $2$nd$).$ If multiple nodes are created for same state, say $$f$,$ use f$1,$ f$2,$ f$3,$ etc., to denote each node $($the number corresponding to node being created$).$ Break tie in favor of node with a lower alphabetic order, e$.$g$.,$b$$ has a higher priority than $$c$.$

DFS$($b$)$ Report the order of the nodes being visited, and the Fringe structure $($report fringe structure of each step as show in the table below$)$