Consider an unauthenticated resonance of dimension n. Each node v treasurys an input i(v), which is a boolean prize. When the algorithm terminates, then total node is to treasury the output in its special unsteady. Total node knows n, in that n can be a sever of statute. (a) Give a deterministic algorithm to calculate the global boolean OR of whole input prizes of the nodes of the resonance. (b) Show that any such algorithm requires (n2) messages.