Se all neces tenet vast'; G al nedol ile ( ty) do 4.de ( t be visited HA visit true // Visit de for every geix. y ve are want all ages 11 ( has not been visited ) 60 Bewoo Figure 2: Breath First Search () Question 2 [1 pt) Figure 1 shows a search tree with 21 nodes. Please uses Breath First Search (BFS) algorithm showing in Figure 2 to traverse the tree and report the order of the nodes being visited Please report Queue structure of each step as show in the table below (0.5 pt]. Compare the Queue structure and explain the memory consumption with respect to branching factor (b) and the search depth (d(0.5 pt). BFS|Queue Node visited Queue Size Search depth