Write a computer program that will simultaneously find the values of k and R that minimize W1 + 1/R in equation. On the first run, have R range from 0.1 to 6 in steps of 0.01 and have k range from 0 to 3 in steps of 0.01; compute W1 + 1/R for all possible pairs of k and R values in these ranges and have the computer find the pair of k and R values that gives the smallest W1 + 1/R. Let these values be k' and R'. Rerun the program with k and R ranging from k' - 0.01 to k' + 0.01 and R' - 0.01 to R' + 0.01, respectively, each in steps of 0.0001 to find the optimum k and R, each accurate to 0.0001. (For much more efficient ways to find the minimum of a function of two variables see Press et al., Chapter 10.)