A database has five transactions. Let min sup = 60% and min conf = 80%.

TID items

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, O, O, K, I, E}

(1) Find all frequent itemsets of a single item using the Apriori algorithm.

(2) Find all frequent itemsets of two items continuing the algorithm.

(3) Find all frequent itemsets of three items

(4) List all the strong association rules (with support s and confidence c) matching the following metarule, where X is a variable representing customers, and itemi denotes variables representing items (e.g., ?A,? ?B,?): For all x in transaction, buys (X, item1) ^ buys (X, item2) => buys(X, item3) [s, c]