Q3: In the cell (or cells) below determine how long it would take an O(n lg n) algorithm to process 100,000 inputs if we know that processing 10 inputs takes .0001 seconds. Since we're dealing with estimates you may assume "lg 10" is 3.15 and "lg 100,000" is 16.6.

n = (.01*2**40)/100**2 print('Answer is: ', n, ' seconds')

Answer is: 1099511.627776 seconds

Q4: What difference do you see in the speed with which the above algorithms would be expected to scale up to larger input sizes? Each seems to do well at low volumes. How well at higher volumes?