Problem 1 (10 points) Exercise 6.3.1 MMDS book) Here is a collection of twelve baskets. Each contains three of the six items 1 through 6 11,2,3) 12,3,4) 3,4,5) 4,5,6) 1,3,5 2,4,6 1,3,4) 12, 4, 5 (3,5,6) 1,2,4) 2,3,5) 3, 4,6) Suppose the support threshold is 4. On the first pass of the PCY Algorithm we use a hash table with 11 buckets, and the set i, j is hashed to bucket i x j mod 11 (a) [5 points] Which buckets are frequent? (b) 5points] Which pairs are counted on the second pass of the PCY Algorithm