QUESTION 9 Is O(Ti) = 0(Pi)? Also, is O(T; a) = o(Pia)? Assume the same notations as used in string-matching finite state automaton. i is the ith index of the string. 'a' is any character False, False True, False True, True False, True QUESTION 4 Ifx ) y, then is o (x) Co (y)? (o is the suffix function.) O True O False QUESTION 5 In the algorithm proposed by Karp and Rabin to find a pattern text P in a text string T, what is another reasonable way to account for the finger-print of a sliding window over the text string T? Hint: What could be a possible finger-print function when I do not want to reiterate through the characters of ts to compute t5+1 ? O Consider shifting the sliding window based on a pre-populated table called the prefix-table. Consider the number of occurrences of every character in Ports. O Consider taking a hash with a time complexity of O(n.logm) for P and also for the sliding window as it progresses through T. QUESTION 6 What is the average-case time complexity of Rabin-Karp-Matcher ? Assume n>>m. And, also assume only a countably 'few' valid and spurious hits unlike the worst-case. O e(n) O O(n-m+1)m) O m) O 6m2) QUESTION 9 Is O(Ti) = 0(Pi)? Also, is O(T; a) = o(Pia)? Assume the same notations as used in string-matching finite state automaton. i is the ith index of the string. 'a' is any character False, False True, False True, True False, True QUESTION 4 Ifx ) y, then is o (x) Co (y)? (o is the suffix function.) O True O False QUESTION 5 In the algorithm proposed by Karp and Rabin to find a pattern text P in a text string T, what is another reasonable way to account for the finger-print of a sliding window over the text string T? Hint: What could be a possible finger-print function when I do not want to reiterate through the characters of ts to compute t5+1 ? O Consider shifting the sliding window based on a pre-populated table called the prefix-table. Consider the number of occurrences of every character in Ports. O Consider taking a hash with a time complexity of O(n.logm) for P and also for the sliding window as it progresses through T. QUESTION 6 What is the average-case time complexity of Rabin-Karp-Matcher ? Assume n>>m. And, also assume only a countably 'few' valid and spurious hits unlike the worst-case. O e(n) O O(n-m+1)m) O m) O 6m2)