Brute Force String Matching Homework. Unanswered Which of the following would likely improve (lower) the total time required by the Brute Force String-Matching Algorithm O Multiple answers: Multiple answers are accepted for this question Select one or more answers and submit. For keyboard navigation... SHOW MORE a Increased length of the text b Increased length of the pattern Increased size of the alphabet d Increased randomization in the text Increased randomization in the pattern Rabin-Karp: Calculating the Hash-Fingerprint Homework. Unanswered Assuming an alphabet A-Z with corresponding ordinal values 0-25, and a modulus of 1000 (admittedly not prime), what is hash- fingerprint of "HASH"? Select an answer and submit. For keyboard navigation, use the up/down arrow keys to select an answer. a 217 b 453 507 d 679 812 f 945