If a computer could consider 1 billion orders a second, how many years would it take to solve the computer configuration problem of Example 2.17 by enumeration if n is 25?

It would take \(\frac{25!}{10^9 \cdot 3600 \cdot 24 \cdot 365} = 491857244\) years