Given a data set with five transactions, each containing five items, as shown in the table. Let min-support = 60%. TID TI T2 T3 T4 TS items bought E, G, S. F. Z) (B, E. D. K. N) (B. E. K. N. O) (B, G, K, NZ) (B, G, N, T, Z) (a) What is the maximum number of possible frequent itemsets given that this data set has 5 items per transaction? (b) Find all frequent itemsets using the Apriori algorithm. Enter each value in alphabetical order with a comma separating each (no spaces). E.g.. AB,AC,BC,BD If there are none, put the word NONE. This is auto-graded so follow instuctions exactly including upper-cose, no spoces, commos, etc All the frequent 1-itemsets: t All the frequent 2-itemsets: All the frequent 3-itemsets: All the frequent 4-itemsets: t All the frequent 5-itemsets: (c) In the computation above, how many rounds of database scans are needed? (d) What is the total number of candidates? The total number of candidates are the number of itemsets considered Given a data set with five transactions, each containing five items, as shown in the table. Let min-support = 60%. TID TI T2 T3 T4 TS items bought E, G, S. F. Z) (B, E. D. K. N) (B. E. K. N. O) (B, G, K, NZ) (B, G, N, T, Z) (a) What is the maximum number of possible frequent itemsets given that this data set has 5 items per transaction? (b) Find all frequent itemsets using the Apriori algorithm. Enter each value in alphabetical order with a comma separating each (no spaces). E.g.. AB,AC,BC,BD If there are none, put the word NONE. This is auto-graded so follow instuctions exactly including upper-cose, no spoces, commos, etc All the frequent 1-itemsets: t All the frequent 2-itemsets: All the frequent 3-itemsets: All the frequent 4-itemsets: t All the frequent 5-itemsets: (c) In the computation above, how many rounds of database scans are needed? (d) What is the total number of candidates? The total number of candidates are the number of itemsets considered