(5 pts.) Show that the obvious algorithm for solving (for x) the 1-by-1 system rx = b is backward stable if executed in matlab on a modern-day computer. Explain your notation and any results / definitions / axioms you are invoking. (Do not show the general (m x m) case; keep it simple!) (5 pts.) Explain how backward stability, the condition number, and the available "computational precision" limit how well we can solve a problem numerically. (You may state a theorem, but it is not necessary (but highly recommended); do not write an essay).