1. There is no single right answer, but whatever answer you do give, justify why you think your assumptions are "reasonable". 
   1. Making reasonable assumptions on processor speed (state what they are), what are practical maximum "sizes" of problems that can be completed in 50 msec (0.05 seconds) for algorithms of the following complexity
      1. n³
      2. n log n.      
         1. 
            
            1.