Show that the Update algorithm can be used for election and computation of
a. a breadth-first search spanning tree by giving an appropriate path-cost function.
b. Give a stabilizing algorithm for computing the network size.
c. Show how to compute the depth of a tree with the Update algorithm.