exercises for help with exercisesplease visit the sitewww wiley com/college/goodrich reinforcement - list the prefixes of the string ="aaabbaaathat are also suffixes of - what is the longest (properprefix of the string "cgtacgttcgtacgthat is also suffix of this stringr- draw figure illustrating the comparisons done by brute-force pattern matching for the text "aaabaadaabaaaand pattern "aabaaar- repeat the previous problem for the boyer-moore algorithmnot counting the comparisons made to compute the last(cfunction - repeat exercise - for the knuth-morris-pratt algorithmnot counting the comparisons made to compute the failure function - compute map representing the last function used in the boyer-moore pattern-matching algorithm for characters in the pattern string"the quick brown fox jumped over lazy catr- compute table representing the knuth-morris-pratt failure function for the pattern string "cgtacgttcgtacr- what is the best way to multiply chain of matrices with dimensions that are and show your work - in figure we illustrate that gtttaa is longest common subsequence for the given strings and howeverthat answer is not unique give another common subsequence of and having length six - show the longest common subsequence array for the two stringsx "skullandbonesy "lullabybabieswhat is longest common subsequence between these stringsr- draw the frequency array and huffman tree for the following string"dogs do not spot hot pots or catsr- draw standard trie for the following set of stringsababbabacccccbbaaaacaabbaacccbcccbca - draw compressed trie for the strings given in the previous problem - draw the compact representation of the suffix trie for the string"minimize minime