given supermarket customer sequences. using the aprioriall algorithm, find length-k sequential patterns. <{1, 8} {2} {3} {4} > <{1} {3} {4} {3, 8}> <{1} {2} {3} {4}>
<{1} {3} {8}>
<{4} {8}>