Answer the following questions using the data sets shown in Figure 6.6. Note that each data set contains 1000 items and 10,000 transactions. Dark cells indicate the presence of items and white cells indicate the absence of items. We will apply the Apriori algorithm to extract frequent itemsets with minsup = 10% (i.e., itemsets must be contained in at least 1000 transactions)?
Figure 6.6

(a) Which data set(s) will produce the most number of frequent itemsets?
(b) Which data set(s) will produce the fewest number of frequent itemsets?
(c) Which data set(s) will produce the longest frequent itemset?
(d) Which data set(s) will produce frequent itemsets with highest maximum support?
(e) Which data set(s) will produce frequent itemsets containing items with wide-varying support levels (i.e., items with mixed support, ranging from less than 20% to more than 70%).

6000 6000 8000 8000 200 400 600 800 6000 8000 200 400 600 800 200 400 600 800 2000 2000 E4000 10% are 1s 90% are 0s (unitormly distributed) 6000 8000 200 400 600 800 200 400 600 800