Answer TRUE or FALSE.
Insertion Sort (as the code is written in this module) is a stable sorting algorithm. Recall that a stable sorting algorithm maintains the relative order of records with equal keys.
Think of the behavior of every pass through the inner for loop of the insertion sort if keys are equal.