There are n websites W={w1,w2,w3,,wn}, and k different content distribution servers (CDS) hosting subsets of the websites. In particular, the set CiW denotes the websites hosted by the i th CDS. Note that the sets C1,,Ck could overlap. Let the quantity m(C1,C2,,Ck) represent how many websites are hosted in total by these k different CDS servers (this notation indicates that it is a function of the sets C1,C2,,Ck ). The question is to understand m(C1,,Ck) by proving upper and lower bounds. (a) Express the number of websites hosted by the k CDS servers m(C1,C2,,Ck) in terms of the cardinality of an appropriate set. (b) Prove that m(C1,,Ck)C1+C2++Ck. (c) m(C1,,Ck)C1++Ck1i