Exercise 19.2.13 (Lawson–Hanson Algorithm) It is known that any A∈ Rm×n can be decomposed as A= QTR such that Q∈ Rm×m is orthogonal and R∈ Rm×n is zero below the main diagonal. This is called the QR decomposition. Solve the LS problem with linear constraints by using the QR decomposition instead of the SVD.