Consider the following transaction database. Let sup_min = 60% and con_fmin = 80%. (a) Find all frequent item sets using Apriori. (b) Find all frequent item sets using FP-growth. (c) List all of the strong association rules (with support s and confidence c) matching the following format, where X is a variable representing transactions, and item_i denotes variables representing items (e.g., "M", "O", etc.). Forall X elementof transaction, buys(X, item_1) (X, item_2) => buys (X, item_3) [s, c]