Here we are considering distributed algorithms for various problems in the CONGEST model. See the notes for more info about the congest model. Let d be the diameter of G. Let n be the number of vertices in G. Let ? be the maxinum degree of any vertex in G. Note that the algorithm does not know d, ?, or n a priori. You can assume that cach node in the network starts with a unique ID integer consisting of O(log n) bits Note that these ID's are not necessarily 1,... ,n (a) Give an O(d) time deterministic algorithm to compute a such that d/2