(a) Approximate the time required to execute the forward phase of GaussJordan elimination for a system of 100,000 equations in 100,000 unknowns using a computer that can execute 1 gigaflop per second. Do the same for the backward phase. (See Table 1.) (b) How many gigaflops per second must a computer be able to execute to find the -decomposition of a matrix of size 10,000 10,000 in less than 0.5 s? (See Table 1.)

tr tr lnt"u. /4,,,|A'ven'obQtrun;-(lmrttnp,^d+ylutv..rnou) 54 i+-toy,^yt^r,-rtru- alura,tttt-rlacn...