1. A database has ten transactions. Let min_sup = 30%.

TID	Items Bought
100	{A, B ,D, E}
200	{B, C, D}
300	{A ,B, D, E}
400	{A, C, D, E}
500	{B, C, D, E}
600	{B, D, E}
700	{C, D}
800	{A, B, C}
900	{A, D, E}
1000	{B, D}

1. Apply the Apriori algorithm to the above data set.

2. Show the FP tree that would be made for the data set.