(a) Compute the border array of the string w = (ab)" for n>2 and n E N. (b) Perform substring search using the Rabin-Karp algorithm on the following text = 689479, and pattern 4 79. The algorithm uses the following hash function: h(r): = a mod 53. When performing the substring search compute the hash functions for 3, 4, 5 using rolling hash. -