(18 points) Suppose we have a transaction database, TDB1, with the following transactions: Ti {a1, A2, ..., 212}, T2 = {210, 211, 220}, T3 = {a1, A2, ..., 220},T4 = {21, 22, ..., 230} (a) (6 points) For TDB1, how many closed patterns and maximal pattern(s) do we have and what are they if the minimum (absolute) support is 1? Justify your answer. (b) (6 points) For TDB1, how many closed patterns and maximal pattern(s) do we have and what are they if the minimum (absolute) support is 2? (c) (6 points) For TDB1, how many closed patterns and maximal pattern(s) do we have and what are they if the minimum (absolute) support is 4? (18 points) Suppose we have a transaction database, TDB1, with the following transactions: Ti {a1, A2, ..., 212}, T2 = {210, 211, 220}, T3 = {a1, A2, ..., 220},T4 = {21, 22, ..., 230} (a) (6 points) For TDB1, how many closed patterns and maximal pattern(s) do we have and what are they if the minimum (absolute) support is 1? Justify your answer. (b) (6 points) For TDB1, how many closed patterns and maximal pattern(s) do we have and what are they if the minimum (absolute) support is 2? (c) (6 points) For TDB1, how many closed patterns and maximal pattern(s) do we have and what are they if the minimum (absolute) support is 4