Carry out the Rabin-Karp string matching algorithm to search for the pattern P = acae in the text T = bacaeadacabacdabeeda. You may assume that there are only 5 letters in the alphabet, and that the letters a through e map to the digits 0 through 4 in the obvious way. You can verify that d = 5, m = 4, and n = 20. Set q = 97. A. Compute p, the (decimal) value that corresponds to the pattern P. Show your complete solution. B. Compute t4, the (decimal) value that corresponds to the substring of T at shift 4. Show your complete solution.