Compare performance of three algorithms: Newton's method, bisection method, and the fixed-point iteration method. Write a code implementing Newton's method, the bisection method, and the fixed-point method. Keep the programing in such a way as to be able to compare performance of the three methods on a selected function. Use the bisection method, the fixed point method and the New- ton's method to solve the problem of determining all roots of the function: f(x) = sin x, on [-0.5, 5]. . Write a report. Include results of your calculations with some minor comments. Compare the performance of the three meth- ods in terms of number of iterations and accuracy. Include any additional comments you would like to share. Attach the code.