Let minimum support = 25%; that is. a frequent items et must have support count 2 2. Find all frequent itemsets using the npriori algoritl1m. Show your computation steps in a way similar to the example in le tutorial notes. For the frequent itemset that contains the largest number of items. calculate the confidence and lift values for all the rules that can be generated from that itemset {again. similar to the example in the notes}