Finding closed and maximal patterns from a transactional database

If we have a transactional database TDB1 with T1 = {a1, a2, . . . , a12}, T2 = {a10, a11, a20}, T3 = {a1, a2, . . . , a20}, T4 = {a1, a2, . . . , a30}

How would we go about finding the closed and maximal patterns with a minimum support count of 2?