Let c be a candidate itemset in Ck generated by the Apriori algorithm. How many length-(k - 1) subsets do we need to check in the prune step? Per your previous answer, can you give an improved version of procedure has infrequent subset in Figure 6.4?