a$.$ Considering the given table of transactions, apply the Apriori algorithm with minSupport $=50\%$ to generate

all frequent itemsets.

b$.$ Which of the itemsets found in the previous part are closed? Which of them are maximal?

c$.$ Sketch the complete itemset lattice graph pointing out the positive border and the negative border.

d$.$ For all frequent itemsets of maximal length, generate the corresponding asscociation rules with

minConfidence threshold $60\%.$