Q$2$: Comparison of Linear Search and Binary Search

$1)$ Given an array of $1000$ elements, determine how many comparisons are needed in the worst case for:

Linear Search to find a specific element.

Binary Search to find a specific element.

Briefly explain the calculation process for each method.

$2)$ Explain why the array must be ordered for binary search to work correctly. What would happen if the array is unordered and you try to use binary search? Provide a brief explanation.

$3)$ Given the array $\backslash ($ A$=\backslash \{2,4,6,8,10,12,14,16,18,20\backslash \}\backslash ),$ use binary search to find the value $14.$

Describe each step of the search process, including the midpoint calculation and any updates to the search range. Indicate the final index at which the value is found.

$4)$ Compare the time complexity of linear search and binary search in terms of Big O notation.