Consider the following transactional dataset. Using Apriori Algorithm: i) find all the frequent itemsets [5 Marks] ii) then, find all the association rules from the largest frequent itemset [5 Marks] Note that you have to show the step-by-step process how you generated and pruned the candidate association rules (do not use brute force candidate rule generation approach). [Assume that both the Minimum Support and the Minimum Confidence Threshold is 40% ] NOTE*: Please refer below to the BL - Bloom's Taxonomy Levels and mention the respective level in the questions