1. List the steps that the insertion sort algorithm would make in sorting the following values: 4, 1, 3, 2. 2. Assume the following main module is in a program that includes the binarySearch function...

2. Assume the following main module is in a program that includes the binarySearch function that was shown in this chapter. Why doesn't the pseudocode in the main module work? // This program uses the binarySearch function to search for a // name in the array. This program assumes the binarySearch // function has already been defined. Module main() Constant Integer SIZE = 5 Declare String names[SIZE] = "Zack", "James", "Pam", "Marc", "Susan" Declare String searchName Declare Integer index Display "Enter a name to search for." Input searchName Set index = binarySearch(names, searchName, SIZE) If index != -1 Then Display searchName, " was found." Else Display searchName, " was NOT found." End If End Module