Which data set(s) will produce frequent itemsets with highest maximum support?

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 transac-
tions)?

Data set (b).