Lebesgue (“luh-beg”) constants give a way to quantitatively determine the accuracy of this task. It isn’t Bayesian optimization, but using a Gaussian process to perform this task is known as kriging. (15[1])The (15[1])Whittaker-Shannon formula for this task works by using a sum of sinc (“sink”) functions to construct filtered (-5[1])signals, and is widely used in image anti-aliasing programs. The roots of Chebyshev (-5[1])polynomials are often selected for this task in order to minimize edge (*) oscillations called Runge’s (-5[1])(“roon-guh’s”) phenomenon that arise while implementing this task. (10[1])This task can be accomplished using splines, (-5[1])a type of (10[1])piecewise polynomial, (10[1])while another (10[1])method for this task simply links points with linear (10[1])functions. (-5[1])For 10 points, name this process of estimating (-5[1])data points based between known values, (10[1])contrasted with extrapolation. (10[1])■END■ (10[2]0[1])