CHARM recursive algorithm complexity in loop

I would really like your opinion on the way to detect the T(n) (Working Time) for the next recursive algorithm. Allure is an algorithm for locating frequent closed itemsets in a transaction database. A listing of frequent closed itemsets are frequent gadgets that seem a number of occasions in a set of transactions (tids)…