Consider the following frequent $3-$sequences:

a$)$ Generate all the candidate $4-$sequences from the given frequent $3-$sequences, using the method for

candidate generation described in the book. For every $4-$sequence generated, also write down the

corresponding $3-$sequences that were merged to generate the $4-$sequence. Show all work.

b$)$ Find out the candidate $4-$sequence that would survive the candidate pruning.