Graph f 1 (n) = n log n, f 2 (n) = n 1.5 , and f3(n) = n 2 in the range 1 ≤ n ≤ 1000 to visually compare their growth rates. Typically, the constant factor in the running-time expression for an...

Graph f₁(n) = n log n, f₂(n) = n^1.5
, and f3(n) = n²
in the range 1 ≤ n ≤ 1000 to visually compare their growth rates. Typically, the constant factor in the running-time expression for an implementation of Insertion Sort will be less than the constant factors for Shellsort or Quicksort. How many times greater can the constant factor be for Shellsort to be faster than Insertion Sort when n = 1000? How many times greater can the constant factor be for Quicksort to be faster than Insertion Sort when n = 1000?