Suppose you have been asked to find as many prime numbers as possible. $($A prime number is one that cannot be evenly divided by any smaller integer other than $1.)$ You know that it is impossible to test all the positive integers, so you devise a strategy for testing only certain numbers that you guess might be primes. Your way of solving this problem makes use of a$.$ heuristics. b$.$ an algorithm. c$.$ a prototype. d$.$ base$-$rate information.