a. Given the set of data above. Calculate Sup and Conf when applying rules {a, b} {e}, and {b} {g}

b. Using the Apriori algorithm, find all k-item frequent itemsets from the following dataset. Consider k=3. First, you need to show all the scanning steps. Then, the final result for k=3 would be ________.

\begin{tabular}{|l|l|} \hline ID & Sequences \\ \hline S1 & {a,b},{c},{f},{g},{e} \\ \hline S2 & {a,d},{c},{b},{a,b,e,f} \\ \hline S3 & {a},{b},{f},{e} \\ \hline S4 & {b},{f,g} \\ \hline S5 & {b},{g} \\ \hline \end{tabular} \begin{tabular}{|l|l|} \hline T1 & 1,3,4,7 \\ \hline T2 & 2,3,5 \\ \hline T3 & 1,2,3,5,8 \\ \hline T4 & 2,5, \\ \hline T5 & 1,7 \\ \hline \end{tabular} \begin{tabular}{|l|l|} \hline ID & Sequences \\ \hline S1 & {a,b},{c},{f},{g},{e} \\ \hline S2 & {a,d},{c},{b},{a,b,e,f} \\ \hline S3 & {a},{b},{f},{e} \\ \hline S4 & {b},{f,g} \\ \hline S5 & {b},{g} \\ \hline \end{tabular} \begin{tabular}{|l|l|} \hline T1 & 1,3,4,7 \\ \hline T2 & 2,3,5 \\ \hline T3 & 1,2,3,5,8 \\ \hline T4 & 2,5, \\ \hline T5 & 1,7 \\ \hline \end{tabular}