The ENIAC was the first general purpose, programmable computer and cost about $7$ million dollars to build. It was capable of computing $500$ floating point operations per second. What is the largest n such that ENIAC could perform Gaussian elimination with backwards substitution $($i$.$e$.$ Algorithm $6\mathrm{.}1$ of the textbook$)$ on a system of n equations in at most $2$ seconds.