P5. Do not hand in. Likely to be featured in exam. On R, which we call the ty-plane or tu-plane instead of xy-plane, a bunch of points ( 1,U1), (t2,U2), ."., (tm,Um) on the plane can be "best fit" by a straight line y(t) = at + b on the same plane when the sum of squares Z,(U; - V(t;)) is minimized over suitably chosen a, b, namely when the distance || u - y || between the two vectors v(t1) U = U2 V= v(t2) is minimized over suitably chosen a, b. This optimization problem can be formulated as a least square problem in the form B = u where B is m-by-2. Determine the matrix Um v(tm) B. Note: Provide necessary concise logic steps leading to your answer. No credit for correct answer without valid justification. Note: This "best fit" only minimizes the vertical distances from the m points to the fitting line. There is another "best fit" which minimizes the distances from the m points to the fitting line, as we discussed in class. The latter is a harder problem, a type of "nonlinear" least squares