Question 1. 5 mark:s Consider the following transactions. Each row corresponds to a transaction where 1 corresponds to a presence of an item and 0 corresponds to an absence t20100 t31011 (a) [5 Marks, 4000-enrollment only) Let the minimum support threshold be 2. Please illustrate the four steps of the FP-tree growth algorithm with the above example. (b) [5 Marks, 6000-enrollment only] An itemset Y is a proper super-itemset of X if X C Y. An itemset X is said to be closed if there exists no proper super-itemset Y such that Y has the same support count as X. Please illustrate how to use the FP-tree growth algorithm to compute all closed itemsets of support2 2 using the above example