The following is a set of ten transactions in a convenience store. Let's assume minimum support = 30%: that is, a frequent itemset must have support count greaterthanorequalto 3. (a) Find all frequent itemsets using the Apriori algorithm. Show your computation steps. (b) Generate all possible rules from the frequent itemsets that contain the largest number of items and calculate the confidence and lift values for each rule generated. (c) Assume that the minimum confidence required is 70%, identify and rank the rules that have at least minimum confidence