(28 points) Giving the following transaction database, we will focus on frequent pattern mining with minimum absolute support of 3. TID T1 T2 T3 T4 T5 T6 T7 TO T9 T10 T11 Items A,B,C A,D,E B,D A,B,D A.C B,C A.C A,B,C,D,E B,C A.D A,B,C (a) (4 points) For an association rule A= B(s,c), calculate its support s and confidence c. (b) (8 points) Find all frequent itemsets using Apriori algorithm. Please show all interme- diate steps to get full credit. (c) (10 points) What is the FP-tree corresponding to transactions in Table 1? Require- ments: Please insert transactions in the order of T1, T2...T11. You need to demonstrate three FP-Trees after inserting 1-st, 5-th and the last transaction (T11) to get the full credit. (d) (6 points) Find all frequent itemsets using the FP-Growth algorithm. Requirements: Please draw a table of conditional database derived from the FP-tree in the previous question (see Page.50 of slides 05FPBasic(Feb23)) to get the full credit