$($a$)$ Indicate whether the below statements are True $($T$)$ or False $($F$).$ No justification of

the answer is needed.

$($i$)$ Our use of association analysis will yield the same frequent itemsets and strong association rules whether a specific item occurs once or three times in an individual

transaction.

$($ii$)$ In association rule mining the generation of the frequent itermsets is a computationally intensive step.

$($iii$)$ Suppose ABC is a frequent itemset and BCDE is NOT a frequent itemset. Given

this information, we can be sure that BC is certainly frequent.

$($iv$)$ Suppose ABC is a frequent itemset and BCDE is NOT a frequent itemset. Given

this information, we can be sure that BCE is certainly not frequent.

$($v$)$ The k$-$means clustering algorithm will automatically find the best value of k as part

of its normal operation.