3. (18 points) Suppose we have a transaction database, TDBl, with the following transactions: T1 = {(11,022 - - - ,012},T2 = {010,011,020},T3 = {01,021- - - ,020},T4 = {01,a2, - - - #130} (a) (6 points) For TDBl, for a minimum (absolute) support of 1, Le, minsup = 1, how many closed patterns and maximal pattern(s) do we have and what are they? Clearly justify your answer. (b) (6 points) For TDBl, for a minimum (absolute) support of 2, i.e., minsup = 2, how many closed patterns and maximal pattern(s) do we have and what are they? Clearly justify your answer. (0) (6 points) For TDBl, for a minimum (absolute) support of 4, Le, minsup = 4, how many closed patterns and maximal pattern(s) do we have and what are they? Clearly justify your