Suppose your array contained 1,000,000 elements: for a sequential search, how many comparisons would the program need to find the last value in the array? for a binary search, how many comparisons would the program need to find the last value? in this case, which do you think will be faster?

Arecipients list has been loaded into a document. which commands should be clicked in order to filter the list so that letters will not be printed for recipients who live in a certain state? mailings tab, start mail merge, select recipients, type new list, then insert only contacts from the desired states mailings tab, rules, select recipients, use existing list, then choose a recipients list that includes only contacts in certain states mailings tab, select recipients, use existing list, rules, fill in, then type in certain states mailings tab, rules, skip record select “state” under field name, then type in the state name under “equal to”