1. Analyse the graph shown in Figure 2 using the breadth-first search tree traversal algorithm. Show the step-by-step traversal of the algorithm. Assume that the traversal starts from vertex A. [10 marks]

2. Describe the breadth-first search pseudocode that was used to traverse the graph in Figure2. You may present your answer in the form of a pseudocode. [10 marks]

3. Distinguish between the breadth-first search and depth-first search tree traversal algorithms. [5 marks]

A B D E F SUMMATION FORMULAS 1=1+1+1+ ... +1=u-1+1 (0+1) Ei=1+ 2+ 3+ ... +n= 2 =0 n(n + 1)(2n + 1) i2 = 12 + 22 + 32 + ... + n2 = 6 an+1_1 2. a' = 1+a+ a + ... + an for any a #1 I=0 0-1