2. (a) construct the FP-tree for the set of records below. using minimum support threshold 1. This tree is denoted as T. (Items are already in order by decreasing support) (12 pts) (b) Construct the conditional FP-tree for item / which will be denoted as T, (12 pts) (c) Execute the procedure FP-growth(T;, a), where a- ). Show the step by step details and the generated patterns together with their support counts. (p. 260) (12 pts) (d) Construct the conditional FP-tree for item d, which will be denoted as Ta. (10 pts) (e) Execute FP-growth (T. td), Show the step by step details and the generated patterms together with their support counts. (18 pts) The set of items is l#{a, b, c, d, e, f,g) The set of records is below. a, b, c, d, e a, c, e, f b, d g a, b, c. e a, c. e b, d a, c, d