For Q5 consider the following dataset D with five transactions, and assume minSupp=50% and minConf=80%.

TID Transactions

T1 {M.O,K,E,Y}

T2 {D,O,K,E,Y}

T3 {M,A,K,E}

T4 {M,U,K,Y}

Q5. Give the matching dataset of the longest frequent itemset mined in Q3.

here is question 3

Q3. Find all frequent patterns from D using the Apriori algorithm (using alphabetic order for item ordering).