Chapter 5.6, Problem 10E

Let A be an $m\times 2$ matrix. Show that if both the classical Gram−Schmidt process and the modified Gram−Schmidt process are applied to the column vectors of A, then both algorithms will produce the exact same QR factorization, even when the computations are carried out in finite-precision arithmetic (i.e., show that both algorithms will perform the exact same arithmetic computations).