Question#ul pointl: CLOI State whether the following statements are True or False T/F Statement Association rules are about relationships between two disjoint itemsets and represent a correlation between them. A strong association rule is not necessary interesting A maximal frequent item set is always closed. A problem with FP-Growth algorithm is that it needs to repeatedly scan the whole database and check a large set of candidates. Question#2 [1 point: CLO4 Given the Frequent itemset L-{A,D,M,K), Complete the following association rules generated from L. {A,D) A.D,M) (A) {A,K)