Which statement is not true about the sequential search algorithm? a. An unordered array must use sequential search. b. The algorithm returns the index of the target if it is found. c. The sequential search algorithm is faster than binary search. d. The sequential search algorithm ends when either it finds the target or runs off the end of the Which statement is not true about the binary search algorithm? a. It begins its search for the target in the middle of the array. b. The algorithm returns the index of the target if it is found. c. The algorithm can only be applied when the target is found in the array. d. It reduces the amount of array to be examined by approximately half on each pass. Use the following array for the next three questions: Which element of the array will first be compared to target 25 using the binary search a. 10 b. 30 c. 40 d. 70 When searching for target 25 using the binary search algorithm, what are the values of array first at the start of the second pass? a. 0 b. 2 c. 3 d. 4 e. 6 When searching for target 25 using the binary search algorithm, what are the values of array last at the start of the second pass? a. 0 b. 2 c. 3 d. 4 e. 6