a. Prove that a neighbor of a node of level f in the BFS tree has level f - 1, f, or f + 1.
b. Analyze the complexity of the breadth-first search algorithms in terms of N, lEI, and D (the network diameter).
Text Book: Introduction to Distributed Algorithms By Gerard Tel.