The idea for Insertion Sort is to take in the first two elements in the array, compare them, and if not in order, swap them and then include the third element and compare it to the first two. Is this statement true or false?
1) True
2) False