6.6 A database has five transactions. Let min sup D 60% and min conf D 80%. TID items_bought T100 (M, O, N,K, E, Y) T200 (D, O, N, K, E, Y T300 {M, A,K, E) T400 (M, U, C, K,Y) T500 {C, 0, 0, K, I, E) (a) Find all frequent itemsets using Apriori and FP-growth, respectively. Compare the efficiency of the two mining processes. (b) List all the strong association rules (with support s and confidence c) matching the following metarule, where X is a variable representing customers, and item; denotes variables representing items (e.g., "A, B,): Vx e transaction, buys(X, item) buys(X, item) = buys(X, item) (sc)