From the theory of SVD’s we know G can be decomposed as a sum of rank-many rankone matrices. Suppose that G is approximated by a rank-one matrix sqT with s ∈ Rn and q ∈ Rm with non-negative components. Can you use this fact to give a difficulty score or rating? What is the possible meaning of the vector s? Note one can use the top singular value decomposition to get this score vector!

How to solve it and what thw answer is

Asap describe the transformations required to obtain the graph of the function f(x) from the graph of the function g(x). f(x)=-5.8sin x. g(x)=sin x. a: vertical stretch by a factor of 5.8, reflection across y-axis. b: vertical stretch by a factor of 5.8,reflection across x-axis. c: horizontal stretch by a factor of 5.8, reflection across x-axis. d: horizontal stretch by a factor of 5.8 reflection across y-axis.

Can someone me with the property questions for 12 13 and 14 plz