Although both the sequential and binary search algorithms have their merits, what are the rules for choosing when to utilize each algorithm?

(Data processing) The answers to a true-false test are as follows: T T F F T. Given a twodimensional answer array, in which each row corresponds to the answers provided on one test, write a function that accepts the two-dimensional array and number of tests as parameters and returns a one-dimensional array containing the grades for each test. (Each question is worth 5 points, so the maximum possible grade is 25.) Test your function with the following data:

(Data processing) Determine and write an algorithm to determine the total occurrences of the letter e in any sentence.

(Sorting) Read a set of numerical grades from the keyboard into an array. The maximum number of grades to be entered is 50, and data entry should be terminated when a negative number is entered. Have your program sort and print the grades in descending order.

A(n) __________ is an array of characters.

(Practice) Use the max_element and min_element algorithms to determine the maximum and minimum values in the vector created for Exercise 8. (Hint: Use the expression max_ element(vectorName.begin(), vectorName.end()) to determine the maximum value stored in the vector. Then use the same arguments for the min_element algorithm.)