data mining and data warehousing subject.

A database has five transactions. Let min sup = 60% and min conf = 80% TID T100 T200 T300 1400 T500 items_bought {M, O, N, K, E, Y} {D, O, N, K, E, Y} {M, A, K, E} {M, U, C, K, Y} {C, O, O, K, I ,E} Find all frequent item sets using Apriori Algorithm (Let Min Support Count is 3). List all of the strong association rules (with supports and confidence c). [10]