Consider the transactions in Table 2. Let minimum support and minimum confidence be 30% and 30%, respectively.

1. Using Apriori algorithm, find frequent itemsets.

2. List all rules in the form {X, Y } Z, meaning that if someone buys X and Y, then he/she will also buy Z. List the support and confidence of matching rules.

ID bought 001tQ, W, T, R) 002 | {T, w, , E, R} 003 Y, W, R, E) 004 W, T, Y) 005 Q, E, R) 006 Q, w, T) Table 2: Transactions