Suppose you want to implement a division algorithm using only multiplication, addi tion, and subtraction. Given scalars (1,5) 6 R, the goal is to solve a3: = b for :1: without using any division. (a) For what values of c does the FPI n+1 2 ob + (1 0(1):.13;C solve this problem? What is the rate of convergence? (b) Show that applying Newton's method to solve 0 2 at) 2 (1:1: b does not solve this problem. (c) Show that we can apply Newton's method to f(z) = 1/2 a to nd 75* = 1/0 which we can then multiply by b. (d) Find and justify the rate of convergence of the N ewton's method from part (c)