When implementing Insertion Sort, a binary search could be used to locate the position within the first i-1 records of the array into which record i should be inserted. Using binary search will:

Not speed up the asymptotic running time because shifting the records to make room for the insert will require \Theta(i) time
  • Speed up the asymptotic running time because the position to insert will be found in \Theta(\log i) time
  • Speed up the asymptotic running time because shifting the records to make room for the insert will require \Theta(i) time
  • None of these answers is correct

The position at which to insert could be found in \Theta(\log(i)) steps, but shifting the records to make room for the this record will require \Theta(i) time.