Q5: A. Let we have this text and pattern Text: GCATCG|C|AGAGAGT|ATACAGAACG Patterm: AG|A Use Boyer-Moore string matching algorithm to find all patterns in text. (show work step by step) Write an efficient algorithm that presents your solution in the last part. Explain with a small number of words and small example who we can use space between words to make the algorithm of string matching better in general. B. Search for ARTICLE that improves the work of the string-matching algorithms discussed in lectures (BF, Boyer-Moore, KMP). For the selected paper Summarize the article What are the key points of the article regarding the algorithms?