(a) Prove that all nonempty subsets of a frequent itemset must also be frequent

Question

The Apriori algorithm uses prior knowledge of subset support properties. (a) Prove that all nonempty subsets of a frequent itemset must also be frequent. (b) Prove that the supp