The three tаbles belоw cоntаin itemsets аnd suppоrt counts during the Apriori algorithm. The minimum support count threshold for frequent itemset is 3. For example, {Coke} is infrequent since its support count is 2 (below the minimum threshold 3). Please also note that there is no frequent itemset of size 4. Based on the apriori principle, how many candidate itemsets are pruned out? Please input a single number (e.g.,0, 1, 2, 3, etc.).