Which statement is true about the second Binsort pseudocode algorithm presented in this module? Recall that a stable sorting algorithm maintains the relative order of records with equal keys.

It is a stable algorithm
  • It can be modified to make it stable
  • It is not stable, and there is no easy way to make it stable
  • None of these answers

It processes the records from first to last.

Given two records with the same key value, where does the second one go?

It goes at the end of the bin, so they do not switch order.