Please Solve the following using MATLAB ! Thank you in advanced!

Exercise 10: The exhaustive search PART 1: Suppose you have 2 sequences, seql and seq2. seqi has a length of N and seg2 has a length of length M, where M M. View a sequence of length N as being a string (i.e. a 1 by N array of characters). How many continugous 2-character sequences can be made from seq2? Write a script that identifies each of the contiguous 2-character sequences from seq2 and counts their number. The script should also search for matches (and the frequency of matches) within seql for each 2-character sequence. PART 2: How many contiguous 3-character sequences can be made from seq2? Write a script that identifies each of the contiguous 3-character sequences from seq2 and counts their number. The script should also search for matches (and the frequency of matches) within seql for each 3-character sequence PART 3: How many contiquous M-1 character sequences can be made out from seq2? How many contiguous M character sequence can be made from seq2? Write a script that identifies each of the M-1 and M character sequences and counts their number. The script should also search for their matches (and the frequency of matches) within seql