(a) Set A = 0 and use the Nelder-Mead algorithm to find the Bs that minimize L. Initialize your points on [0, 1) and increase the number of iterations to 200. Compare to the value of optim. Keep the best Nelder-Mead point at each iteration for each S and make a convergence plot like the ones above (as shown in page 3 of w07dl notes) for each B. (b) Repeat the above for A = 1/2. Explain your result. (c) Repeat the above (A = 1/2) for a smaller termination threshold of .001. Explain your result