Question 4: (20 points) A database has 5 transactions. Let min sup = 0.6 and min conf =0.8. Customer Date Item bought 100 10/15 { C, F, A, E, D, H) 200 10/15 {H,A,B.C) 300 10/16 {D,E,C.B) 400 10/18 {C,A,G,D,B) 500 10/19 {A, H,G,C) (1) Find all frequent itemsets using the Apriori method, and then list the frequent k-itemset for the largest k (6 points) (2) List all closed frequent itemsets and max frequent itemsets (6 points) (3) List all the strong association rules (with support and confidence) for the following shape of rules (8 points): V X E transaction, buys(x, item 1 ) A buys(x, item 2 ) = buys(x, item 3 ). [s, c]