4 12 pts] Figure 1 shows a search tree with 21 nodes. Please uses BFS, and DFS algorithms showing in Figures 2, 3, and 4 to report the order of the nodes being visited, and the Fringe structure of each method (report fringe structure of each step as show in the table below) [1 pt]. Please compare the fringe structure and explain the memory consumption of each method, with respect to branching factor (b) and the search depth (d) [1 pt]. Fringe Node visited Fringe Size Search depth 4 12 pts] Figure 1 shows a search tree with 21 nodes. Please uses BFS, and DFS algorithms showing in Figures 2, 3, and 4 to report the order of the nodes being visited, and the Fringe structure of each method (report fringe structure of each step as show in the table below) [1 pt]. Please compare the fringe structure and explain the memory consumption of each method, with respect to branching factor (b) and the search depth (d) [1 pt]. Fringe Node visited Fringe Size Search depth