I specially need question 2, and I would appreciate a step by step answer so I can understand.

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. M. E. C,A) T400 F, A, N, E, C, A) T500 F,A, C, A) Items 1. Show all frequent k-itemsets using the Apriori algorithm (for the largest k only). 2. Show all frequent k-itemsets using the FP-Growth algorithm (for the largest k only). Draw the FP-tree