24. Many association analysis algorithms rely on an Apriori-like approach for finding frequent patterns. The overall structure of the algorithm is given below uppose we are interested in finding Boolean logical rules such as avbc,d) which may contain both disjunctions and conjunctions of items. The corresponding itemset can be written as(avb),c,d) a. Does the Apriori principle still hold for such itemsets? b. How should the candidate generation step be modified to find such patterns? c. How should the candidate pruning step be modified to find such patterns? d. How should the support counting step be modified to find such patterns? Algorithm 6.5 Apriori-like algorithm 1. k 1 2. Fk- ijielAoNeminsup) (Find frequent 1-patterns.) 3. repeaft 4. k k+1 5. Ck-genCandidate (Fk-1). Candidate Generation) 6. Ck pruneCandidate (Ck,Fk-1). (Candidate Pruning) 7. Ck-count (Ck,D). (Support Counting) 8. FkclcECkAa(c)N2minsup . (Extract frequent patterns) 9. until Fk 0 10. Answer UFk