$($A$)$ Briefly describe the main steps of the Apriori algorithm for mining association rules. Explain how

the algorithm generates the sets of candidate itemsets and how the algorithm prunes the

candidate itemsets.

$($B$)$ Explain the terms Frequent Itemset, Maximal Frequent Itemset, and Closed Itemset. Describe

with the help of a diagram how these three are related.

$($C$)$ Consider the following set of items $\{$A$,$ B$,$ D$,$ F$,$ H$\}.$ Create a set of transactions such that the

association rule $\{$A$,$ D$\}=>\{$F$,$ H$\}$ would have support$=0\mathrm{.}3$ and confidence $0\mathrm{.}6.$