Which of the following statements about the Knuth-Morris-Pratt (KMP) algorithm is not correct? O a. When checking if the pattern occurs at a character in a text, the KMP algorithm always compares the first character of the pattern with the corresponding character in the text. b. The time complexity of the KMP algorithm is O(m + n), where m and n are the sizes of the pattern and the text, respectively. O c. The failure function can be computed in O(m) time, where m is the size of the pattern. O d. The KMP algorithm is optimal in terms of time complexity.

Which of the following statements about the Knuth-Morris-Pratt (KMP) algorithm is not correct? O a. When checking if the pattern occurs at a character in a text, the KMP algorithm always compares the first character of the pattern with the corresponding character in the text. b. The time complexity of the KMP algorithm is O(m + n), where m and n are the sizes of the pattern and the text, respectively. O c. The failure function can be computed in O(m) time, where m is the size of the pattern. O d. The KMP algorithm is optimal in terms of time complexity