Consider the following database of transactions: TransID 12345 5 Items a, b, c, d b, c, e, f a, d, e, f a, e, f b, d, f Assume an absolute minimum support level of 2. For each level-wise pass of the Apriori algorithm, show the candidate itemsets generated from the join step, the candidate itemsets remaining after pruning, and the frequent itemsets. Note: for each of the following questions, you can EITHER derive the answers by hand OR write a computer program in Python to produce the answers. If you choose to derive the answers by hand, please write down your answers. If you choose to write a computer program, please submit your program as a zip file to avenue. The zip file should include a main.py file, which can be directly executed to produce the results (i.e., print the results on screen) for each of the questions in an easy-to- read manner. If the answers are not easy to read or understand, marks will be deducted. a) Show level 1 candidate itemsets and frequent itemsets. (15 marks) b) Show level 2 candidate itemsets and frequent itemsets. (30 marks) c) Show candidate itemsets and frequent itemsets for the rest of the level(s). (15 marks)