Consider the transactions in Table I. Let minimum support and minimum confidence be 50% and 30%, respectively. Table 1 ID-I- bought 001 Q. W, T, R 002 T, W. Y, E, R) 003 Y, W, R, E 004W. T. Y] 005 Q. E R) 006Q. W, T) (a) Using Aprioi algorithm, find frequent itemsets. (b) List all rules in the form X, Y 2, meaning that if someone buys X and Y, then he/she will also buy Z. List the support and confidence of matching rules