q1 sequential search 11 points q1.14 points grading comment: in what situation can we use sequential search? choice 1 of 5:when the array is sorted and the target is in the array. choice 2 of 5:when the array is sorted and the target is not in the array. choice 3 of 5:when the array is not sorted and the target is in the array. choice 4 of 5:when the array is not sorted and the target is not in the array choice 5 of 5:all of the above q1.22 points grading comment: what is the big o of sequential search? (n is the length of the array) choice 1 of 6:o(1) choice 2 of 6:o(log n) choice 3 of 6:o(n) choice 4 of 6:o(n log n) choice 5 of 6:o(n2) choice 6 of 6:o(!n) q1.35 points grading comment: using the array 11, 30, 34, 90, 99 as the input for sequential search, how many array elements are accessed in order to find the target element 34? choice 1 of 6:1 element choice 2 of 6:2 elements choice 3 of 6:3 elements choice 4 of 6:4 elements choice 5 of 6:5 elements choice 6 of 6:sequential search does not work here q2 binary search 9 points q2.13 points grading comment: in what situation can we use binary search? choice 1 of 6:when the array is sorted and the target is in the array choice 2 of 6:when the array is sorted and the target is not in the array choice 3 of 6:when the array is not sorted and the target is in the array choice 4 of 6:when the array is not sorted and the target is not in the array choice 5 of 6:1 and 2 choice 6 of 6:1 and 3 q2.22 points grading comment: what is the big o of binary search? (n is the length of the array) choice 1 of 6:o(1) choice 2 of 6:o(log n) choice 3 of 6:o(n) choice 4 of 6:o(nlog n) choice 5 of 6:o(n2) choice 6 of 6:o(!n) q2.34 points grading comment: which of the following statements about binary search is not true? choice 1 of 4:it is the fastest searching algorithm we have learned in cs111 choice 2 of 4:it does not work if the target is not in the array choice 3 of 4:it does need extra array space for it to run choice 4 of 4:the best case scenario is when the target is in t
