(100 points) On March 4, 2021, a shopping center database at Atlanta had four transactions. TID Items-bought T100 A($1.0), A($1.1), B($950), B($950), C($3.2), C(-$3.2), C($3.2), D($20), E($5,000), F($1,500), G($35), H($2,500), H($2,500), I($9) T200 A($1.0), B($950), B($951), C($3.2), C($3.2), C(-$3.2), C($1.2), D($), E($1,000), E($5,000), F($1,500), G($35), G($2), H($2,500) T300 A($1.0), B($950), C($3.2), C($3.2), C($3.2), D($20), E($1,000), E($5,00), F($1,500), G($35), G($35) T400 A($1.1), B($950), B($952), C($3.2), F($1,500), F($1,500), H($2,500), H($2,500), H($2,500), H($2,500), G($35), G($35), I($9), I($9) The shopping center's manger only needs top 5 most profitable strong 1-itemset->2-itemset association rules (i.e., buys(item 1) => buys(item 2) and buys(item 3)) for future marketing to maximize profit. Please generate the top 5 most profitable strong 1-itemset->2-itemset association rules. Please make your best effort to write a perfect solution independently and efficiently. (Note: please define your own min support and min confidence, and show clear steps with concise and complete explanation)