1. Run time performance of two algorithms can be accurately measured by timing how fast they run. T/F

2. n²= O (n log n) T/F

3. n²= o (n log n) T/F

4. n²= (n log n) T/F

5. n²= (n log n) T/F

6. n log (n²) +n = (n log n) t/f