A set U of n clients/servers is labeled 1, 2,...,n. A quorum Q is defined as a nonempty subset of the set {1, 2,...,n}. A coterie C is defined as a set of quorums that satisfies the following two properties: 1) nonempty intersection: any two quorums have a nonempty intersection, and 2) minimality property: there are no two quorums such that one is 4 a strict subset of the other. Clients may ask any of the servers for information using quorums from a given coterie C.

Consider an arbitrary client/server system U = {1, 2,...,n} and any coterie C on U. Two clients i, j in U want to exchange data packets but they don’t have a common server: I selects a quorum Q_i in C and j a quorum Q_j in C and ask all servers in their respective sets to enable communication. Can they find a common server? Which one? Provide a brief explanation.