$.$ Inexact Pattern Matching with BWT$.$We discussed two approaches in class for inexact pattern matching of a string Pattern to a string Text: the first was based on "seeding", and the second was based on extending pattern matching with the Burrows$-$Wheeler transform to remember the number of mismatches encountered.When using this second approach in practice, researchers demand that a suffix of Pattern of some given length k matches Text exactly before we start allowing mismatches.Explain why this likely leads to a large reduction in the memory needed.