Given a sequence of values a1, . . , an give an algorithm that finds the coefficients of the polynomial p(x) of degree n such that p(x) = 0 if and only if x = ai for some i. you can assume the elements ai are distinct. your algorithm should run in time o(n log2 n).