Show the full Rabin-Karp method of string matching (the one that converts letters to numbers) on the following pattern and search string. (full means you have to use an appropriately small base and modular arithmetic.) Find all true and false-positive string matches (along with which ones are actually true matches). Show work for each step.

Pattern = abacab String = abacacabacabacababcabaca