$5.[3$ pts$/$ea$]$ Using the following transaction db$,$

TID Items

T$1$ A$,$ C$,$ D

T$2$ B$,$ C$,$ E

T$3$ A$,$ B$,$ C$,$ E

T$4$ B$,$ E

$\text{'}[$T$5$ A$,$ C$,$ E

$($min support$=3)$

$1)$ Show frequent $1-$itemsets along with support values.

$2)$ Show frequent $2-$itemsets along with support values.

$3)$ Show frequent $3-$itemsets along with support values.

$4)$ For an association rule $\{$B$,$C$\}->\{$E$\},$ compute support, confidence, and lift values, respectively.

$5)$ With N items anf M transactions. What is the time complexity generating candidate itemsets $($along with support values$)$ using brute force method $($without Apriori principle$)$

$6)[6$ pts$]$ Change transaction db to FP$-$Tree