(22%) Deduplication and cloud storage Suppose that we develop a deduplication system for cloud storage. We use Rabin finger- printing as the chunking algorithm. Let us assume that we store a file with the following byte sequence {ti,t2, }, where tl denotes the ith byte. Then we operate on the byte se- quence and generate Rabin fingerprints (RFPs) based on the following formula: (d x (P,-1 - dm-1 x t) +t+m) mod q, 0 for some constant parameters m, d, and q. We pick q = 2k for some integer k, and an anchor point is generated ifps == 0, Here, we do not bound the maximum chunk size and do not specifically handle the long runs of zeroes. (a) (3%) Explain one scenario where the average chunk size is greater than 2. (b) (3%) Explain one scenario where the chunking results are equivalent to fixed-size chunking. (22%) Deduplication and cloud storage Suppose that we develop a deduplication system for cloud storage. We use Rabin finger- printing as the chunking algorithm. Let us assume that we store a file with the following byte sequence {ti,t2, }, where tl denotes the ith byte. Then we operate on the byte se- quence and generate Rabin fingerprints (RFPs) based on the following formula: (d x (P,-1 - dm-1 x t) +t+m) mod q, 0 for some constant parameters m, d, and q. We pick q = 2k for some integer k, and an anchor point is generated ifps == 0, Here, we do not bound the maximum chunk size and do not specifically handle the long runs of zeroes. (a) (3%) Explain one scenario where the average chunk size is greater than 2. (b) (3%) Explain one scenario where the chunking results are equivalent to fixed-size chunking