please help with this question (step by step please using tables) and thank you so much :)

no programming language is required for this, just use tables like the one shown in the picture to show the work, thank you :)

1. From the DNA sequence table, as shown below, answer the following questions: Using minSup = 4 I Id Sequence SI ACGTCACG S2 TCGA S3 GACTGCA S4 CAGTC S5 AGCT S6 TGCAGCTC S7 AGTCAG a. Find the maximal frequent sequences. b. Find closed frequent sequences. c. Find the maximal frequent substrings. d. Use Spade and show how it operates in this data. e. Enumerate the working of PrefixSpan algorithm