Briefly describe (no pseudocode or java) how to modify the Rabin-Karp algorithm to search for a given pattern with the additional provision that some character in the pattern is a wildcard, that is, it can be any character. So, for some k = 0, 1,..., M-1, where the length of the pattern is M, the kth character of the pattern can be any character. You may assume that k is given as input along with the text and pattern.