When faced with the challenge of searching a text string for any one of a specified set of k patterns, how would you modify the Rabin-Karp method? Beginning with the assumption that all k patterns...

When faced with the challenge of searching a text string for any one of a specified set of k patterns, how would you modify the Rabin-Karp method? Beginning with the assumption that all k patterns have the same length, we may proceed. Then how about making your approach more broad so that varying lengths of patterns may be accommodated?