(programming required) Prime generation. The key generation implementation from Exercise 7.140 relies on being given two prime numbers. Write a function that, given a (sufficiently large) range of...

(programming required) Prime generation. The key generation implementation from Exercise 7.140 relies on being given two prime numbers. Write a function that, given a (sufficiently large) range of possible numbers between nmin and nmax, repeatedly does the following: choose a random integer between nmin and nmax, and test whether it’s prime using the Miller–Rabin test (see Exercise 7.114).

Exercise 7.114

programming required) Implement the Miller–Rabin primality test (see p. 742) in a language of your choice.