Consider the market basket transactions shown in the table below: Transaction ID Items bought 1 Coke 2 Coke, bread, chips 3 bread, chips, cucumber 4 bread, chips, cucumber, meat 5 Coke, cucumber, meat 6 Coke, bread, chips 7 Coke, bread, chips, cucumber 8 Coke, bread (a) Build the FP-tree for this transaction data set, showing all your workings

Consider the market basket transactions shown in the table below:

1. (a) Build the FP-tree for this transaction data set, showing all your workings. With the information obtained so far and without any extra computation answer the following: If you were to apply Apriori algorithm, how many 2-itemsets candidates would be generated by the Apriori algorithm? Explain.

2. (b) Use the FP-Growth algorithm to extract the frequent itemsets assuming a minimum support of 30%. Show all your workings clearly.

3. (c) Assume a minimum confidence of 60%. Find all the strong rules that satisfy the mini- mum support and minimum confidence. If you have to recommend the best rule, what would this be? Explain.