I would like your opinion on how to detect the T(n) (Running Time) for the following recursive algorithm.

Charm is an algorithm for discovering frequent closed itemsets in a transaction database. A list of frequent closed itemsets are frequent items that appear several times in a set of transactions (tids)