Suppose you have the set \(\mathcal{C}\) of all frequent closed itemsets on a data set \(D\), as well as the support count for each frequent closed itemset. Describe an algorithm to determine whether a given itemset \(X\) is frequent or not, and the support of \(X\) if it is frequent.