Suppose that we were given only the lower limit of 1 in the NLP of Exercise 16-16. Apply 3-point pattern Algorithm 16B to compute a corresponding upper limit with which golden section search could begin using each of the following initial step sizes d.

(a) d = 0.5

(b) d = 16