In Python How to implement a brute force implementation of the apriori algorthim.

Present computation $($clock time$)$ to show that the Apriori algorthim is faster. The brute force method and the Aprior algorthim should output the same assocation rules on each database.

The brute force method for finding frequent itemsets works as follows. Enumerate and generate all possible $1-$itemsets and $2-$itemsets. There are $30$ items, so there are $435$ possible $2-$itemsets totally. Check to see whether each possible $1-$itemset$/2-$itemset is frequent. Then enumerate and generate all possible $3-$itemsets. There are $4060$ possible $3-$itemsets totally. Check to see whether each possible $3-$itemset is frequent. Keep on doing so until you see none of the possible k$-$itemsets is frequent for some k$,$ at which point the brute force method terminates without generating $($ k$+1)-$itemsets.