1. Given Figure 1 below, answer the following questions. 9 5 10 2 6 1 3 4 b) Repeat 1(a) using the Breadth First Search (BFS). 7 11 8 (12) Figure 1 a) Starting from the node 1, apply the Depth First Search (DFS) algorithm. Show the search process step by step. c) From your answer in 1(a) and 1(b), which one do you think is more efficient? Justify your answer.