![1. a) 10 marks] (i) Describe Breadth First Search as an al gorithm for undirected graphs. What is its input, what is its outp](https://media.cheggcdn.com/media%2F2ed%2F2edd7a0e-501e-4fb6-a6ae-4adfee9be0c1%2FphpYCD8Fn.png)
Just answer (ii) please
1. a) 10 marks] (i) Describe Breadth First Search as an al gorithm for undirected graphs. What is its input, what is its output, and what sequence of steps is taken to produce the (B output from the input? C(I (ii) In the network on the side, apply Breadth First Search to determine a spanning tree with root D and the short- est distances from node D to each of
OR
OR