Adapt the synchronous BFS spanning tree algorithm shown in Figure 5.2 to satisfy the following properties.
• The root node can detect after the entire algorithm has terminated. The root should then terminate.
• Each node is able to identify its child nodes without using any additional messages.
What is the resulting space, time, and message complexity?
