matlab only!! matlab only!!

18.17 Develop, debug, and test a program in either a high-level language or macro language of your choice to implement Newton's interpolating polynomial based on Fig. 18.7. Problem 8.17: The problem does not specify a method; use the secant method with initial guesses between 500 and 2000. We are solving for the unknown value Ta. (Note the advantage of the secant method here - we would rather not take the derivative of this function if we can avoid it). SUBROUTINE NewtInt (x, y, n, xi, yint, ea) LOCAL fddnin DOFOR 1 = 0.n fdd1.0 = y END DO DOFORM 1. n DOFOR 1 = 0. n -j fddy.j = (fddi+1,1-1 - fdd1.j-1)/(Xi+) - xi) END DO END DO xterm = 1 yinto = fddoo DOFOR order = 1, n. xterm = xterm * (xi - Xorder-1) yint2 = yintorder: + fddo, order * xterm eaorder- 1 = yint2 - yintorder- yint order = yint2 END Order END Newt Int FIGURE 18.7 An algorithm for Newton's interpolating polynomial written in pseudocode