We can use V to perform polynomial interpolation. In particular, consider a de- gree at most m polynomial p(x) = a0 a1x am1xm1 amxm. We do not know the aj, but we have pairs (xj,yj) for j = 0 to m such that yj = p(xj). (b) Write a matrix-vector equation which allows one to recover a0 y0 a1 y1 a:= . fromy:= . . . am ym as long as all the xj 's are not equal. By uniqueness, this means that there is only one degree at most m polynomial going through m 1 different points