2. This problem finds the curve C + D = b which gives the best least squares fit to the points: t= -2, b = 0 t = -1, b = 0 b=1 t = 0, t = 1, t = 2, b=1 b=1 (a) (10 points) Write down the 5 equations Ax = b that would be satisfied if the curve went through all 5 points. (b) (10 points) Find the least squares solution = (, ). (c) (10 points) Find the projection p of b onto the column space of A, and the error e of using p instead of b in solving Ax = b. 2. This problem finds the curve C + D = b which gives the best least squares fit to the points: t= -2, b = 0 t = -1, b = 0 b=1 t = 0, t = 1, t = 2, b=1 b=1 (a) (10 points) Write down the 5 equations Ax = b that would be satisfied if the curve went through all 5 points. (b) (10 points) Find the least squares solution = (, ). (c) (10 points) Find the projection p of b onto the column space of A, and the error e of using p instead of b in solving Ax = b