We know that the worst case for Insertion Sort is about n^2/2, while the average case is about n^2/4. This means that:

Both of the above
  • The growth rates are the same
  • The runtime in the average case is about half that of the worst case
  • Both of the above
  • None of the above

Growth rates ignore constants.