1. Finding patterns in DNA sequences is a common task in bioinformatics. A DNA sequence is composed of characters A, C, G and T representing adenine, cytosine, guanine and thymine, respectively. The KMP algorithm is used when the text and the pattern are not too long. Before running KMP, we must calculate the failure function of the pattern. We need to find the pattern GACAGATGA in a DNA sequence. Calculate the failure function for the given pattern.