An O(n²) algorithm takes about 0.3 seconds to process 10,000 numbers. Assuming that lower-order terms are insignificant, approximately how long will it take to process 100,000 numbers?
a) 0.3 seconds
b) 3 seconds
c) 30 seconds
d) 300 seconds