(3 marks) We have seen a variety of interpolation techniques: These include Hermite interpolation, cubic spline interpolation and Bezier curves. Suppose that we have obtained an approximating curve. If one data point is removed what is the number of operations required to update the curve for each of the three cases? In each case, select one of the following as your answer and explain your reasoning: O(1), O(log(n)), O(pn), O(n), O(n log(n)) or O(n2) operations. Assume there are n data points, the new point is inserted somewhere near the middle of the interpolating curve and that we choose the optimal algorithm