What is true about the a priori algorithm? Check all that apply.

Question $4$Select one or more:

a$.$

A priori is a top$-$down algorithm that first computes the longest frequent itemset, and then pruning the subsets of that one that fall below the minimum support criterion.

b$.$

The minimum support criterion is arbitrarily selected in the sense that there is no formula to compute it$.$

c$.$

The Apriori Property guarantees that any subset of a frequent itemset is also a frequent itemset

d$.$

None of the above answers are correct.