Q3. This question is about the PCY algorithm for counting frequent pairs of items. Suppose we have six items numbered 1, 2, 3, 4, 5, 6. Consider the following twelve baskets 2. 12,3,4) 3. 3,4,5) 4. 14,5,6) 6. 12,4,6) 7. {1,3, 4) 8. 12,4,5 9. 3,5,6) 10. 1,2,4 11. 12,3,5) 12. 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 { } is hashed to i j mod 11 a) By any method, compute the support for each item and each pair of items. (5 points) b) Which pairs hash to which buckets? (5 points) c) Which buckets are frequent? (3 points) d) Which pairs are counted on the second pass of the PCY algorithm? (2 points)