\\\\table[[Is the data sorted? (yes or no),no,6],[\\\\table[[How many comparisons are made],[to find the first item (index 0 )?]],1,300],[\\\\table[[How many comparisons are made],[to find the middle item (index],[49)?]],50,600],[\\\\table[[How many comparisons are made],[to find the last item (index 99)?]],100,]]\ Step 3-Challenge Questions\ Save these questior's and your answers to the same file as above.\ 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?\ Ans:\ 2.For a Binary Search, how many comparisons would the program need to find the last value?\ Ans:\ \ 3.In this case, which do you think will be faster?

Step 3-Challenge Questions Save these questior's and your answers to the same file as above. Suppose your array contained 1,000,000 elements: 1. For a Sequential Search, how many comparisons would the program need to find the last value in the array? Ans: 2.For a Binary Search, how many comparisons would the program need to find the last value? Ans: 3.In this case, which do you think will be faster