Please Solve using MATLAB Program. Thanks in advanced !

Exercise 11: A smarter search In PART 5 of the prior exercise, you searched through ALL contiguous k-character sequences that could be made from seq2 with k>1. This sort of search has a lot of redundancy since many of the k-character sequences might be repeats Create a new function that achieves the same objective as the one in Exercise 10 PART 5, but only searches through UNIQUE contiguous k-character sequences made from seq2. Use the tic and toc commands to see how long it takes for your new function to complete the task. Exercise 12: An even smarter search In your prior 2 exercises, you' ve been searching through short and long contiguous k-character sequences. 0uldn't it be more efficient to start with the longest sequences and stop once you find the longest matches? That way you never have to search the shorter ones! Write a new function that achieves the same objective as Exercise 11 but starts its search through the longest UNIQUE contiguous k- character sequences. Use the tic and toc commands to see how long it takes for your new function to complete the task