Consider constructing a Newton form of interpolant for a set of (n+1) data points.

(A)Write an algorithm in pseudo code that computes the divided differences for {(x0, y0), {(x1, y1), . . ., {(xn, yn)} and store them in a one-dimensional array, A[]. Two-dimensional array is okay

(B)Apply the algorithm on the data set, {(0,7), (2,11), (3,28), (4,59)} step by step

(C)Write an algorithm in peudo-code that evaluates the Newton form of an interpolating polynomial using a nested form. Given: Pn(x) = a0 + a1(x-x0) + a2(x-x0)(x-x1) + + an(x-x0)(x-x1) (x-xn-1), evaluate Pn(t).

This is all the info that I recieved for the problem. "a" is an algorithm needed in psuedo code that will be used to solve/walk through "b". "C" is the same as "a" in a way that it will be used to walk through similar data points.