15.2 consider an algoruthm for the problem of computing the (full)svd of a matrix the data for this problem is a matrix A, and the solution is three matrices U ,diagonal and unitary such that A= UEV

a) explain what it would mean for this algorithm to be backward stable.

b)in fact for a simple reason, this algorithm cannot be back ward stabel.

the smallest floating point number a in the interval (3,4 such that sl) )