Consider an anonymous ring of size n. Each node v stores an input boolean value i(v). When the algorithm terminates, then every node is to store the output in its private variable. Every node knows n, in that n can be a part of code. (a) Give a deterministic algorithm to compute the global Boolean OR of all input values on the ring. (b) Show that any such algorithm requires (n2) messages. Hint: There is no need to be formal, just give convincing intuitions. Observe that if there is a leader in the network then O(n) messages can suffice.