1. A store database has four transactions.

TID	Items-bought
T100	A($1.0), A($1.1), B($550), B($550), C($1.2), C($1.02), D($200), E($1,000), F($3,500), F($3,500), G($2), H($2,500), I($3)
T200	A($1.0), B($550), B($551), C($1.2), C($-1.2), C($1.2), D($), E($1,000), E($1,000), F($3,500), G($2), G($2), H($2,500)
T300	A($1.0), B($550), C($1.2), C($1.2), C($1.2), D($), E($1,000), E($1,000), F($3,500), G($2), G($2), H($2,500)
T400	A($1.1), B($550), B($552), C($1.2), D($200), F($1,500), F($3,500), H($2,500), H($2,500), I($3), I($3)

The shopping centers manger only needs top 4 most important strong 1-itemset->2-itemset association rules (i.e., buys(X; item1) => buys(X; item2) and buys(X; item3) [S; C]) for future marketing to gain profit as much as possible. Please do data preprocessing, and then generate the top 4 most important strong 1-itemset->2-itemset association rules. Please make your best effort to write a perfect solution. (Note: please define your own min support S and min confidence C, show clear complete steps with necessary concise explanation).