Suppose a sequence database D (shown in table below) contains three sequences as follows. Note (be) means that items b and c are purchased at the same time (i.e., in the same trans- action). The following questions require you to perform GSP algorithm. Let the minimum support be 3 Customer Id Shopping Sequence a(bc)(de)f bc(ad)ef a(bc)d(ab)ef 3 (a) Scan database once, list length-1 sequential pattern candidates Ci and the result L after pruning (b) Following, generate C2, and L2. Hint: do not miss any candidates in C2 (c) Now, generate C3, L3, C4, L4 and longer candidates/results until the algorithm termi- nates Suppose a sequence database D (shown in table below) contains three sequences as follows. Note (be) means that items b and c are purchased at the same time (i.e., in the same trans- action). The following questions require you to perform GSP algorithm. Let the minimum support be 3 Customer Id Shopping Sequence a(bc)(de)f bc(ad)ef a(bc)d(ab)ef 3 (a) Scan database once, list length-1 sequential pattern candidates Ci and the result L after pruning (b) Following, generate C2, and L2. Hint: do not miss any candidates in C2 (c) Now, generate C3, L3, C4, L4 and longer candidates/results until the algorithm termi- nates