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%.

Transaction ID Items T1 {A, B, D, E} T2 {A,C, E} T3 {B, D, E} T4 {A,D, E} T5 {A,B,C,D,E} T6 {C,D,E} T7 {A,B, E} T8 {A,B, D}