Consider the database with min sup 0.6 and min conf 0.8. TID T100 B, O, N, E, C,O T200 B, O,N, E, C, A) T300 C, A, N, E,C, A) T400 F, A, N, E,C, A) T500 F,A, C, A) ltems 1. 2. Show all frequent k-itemsets using the Apriori algorithm (for the largest k only). Show all frequent k-itemsets using the FP-Growth algorithm (for the largest k only). Draw the FP-tree