2. Consider the following set of frequent 3-itemsets: 11, 2, 3,, 11,2,4), 11, 2,5,, 11. 3, 4), 11, 3, 5), $2,3,4), {2,3, 5), 3,4,53 List all candidate 4-itemsets obtained by candidate generation procedure in the Apriori algorithm. List all candidate 4-itemsets that survives the candidate pruning steps of the Apriori algorithm a) b) . Consider the following transaction dataset. T1:a, d, e T2: a, b, c, e T2: a, b, d, e T4: a, c, d, e T5: b, c, e T6: b, d, e T7: c, d T8: a, b, d a) Compute the support for itemsets {e), tb, di, and {b, d, e. b) Compute the confidence for the association rules {b, di -> se) and {e) -> {b, d