(b) Explain the breadth first search algorithm 7 using the graph given below with v1 as the source vertex. 5 7 For each stage of the algorithm give d(v), (v) for each vertex where d(v) is the distance from the source and (u) is the predecessor of vertex v White and gray vertices in the form of sets. (ii) (ii) Vertices in the queue. Also give the Breadth First Tree