1. Show two rules that have a confidence of 0.7 or greater for an itemset containing three items from Exercise 23.
2. For the Partition algorithm, prove that any frequent itemset in the database must appear as a local frequent itemset in at least one partition.