Suppose that p,...,PN are the values used in the Fibonacci search Show that for each k = 1,..., N, 0 Pk 1/2, and for each k = 1,..., N - 1, method. Pk+1 = = 1 - Pk 1. Pk