Build the Knuth Morris Pratt (KMP) border table for the following pattern: bcabbcaba (b) Indicate precisely what character comparisons would be made and the total number of comparisons required if the Knuth Morris Pratt (KMP) algorithm were used to locate the first occurrence of the patterns=bcabbcaba (of part (a)) in the textt=bcabbcabcabbcabaa. [7] (c) How would you modify the KMP string pattern matching algorithm to find every occurrence of a pattern in a text while ensuring the time complexity remainsO(n+m)? [4]