Hello, I would like to solve these questions now, note some of them are multiple-choice and thank you

What is a disadvantage of the Linear search algorithm?

-Suppose I have int b = new int[42].

What are the highest and lowest legal array indexes for b?

1. 1 and 41
2. 1 and 42
3. 0 and 42
4. 0 and 41

-What will happen in a Linear search algorithm if no match is found?

-Let A be a sorting array of size n 2 containing integers from 1 to n1 inclusive, one of which is repeated. Describe an algorithm for finding the integer in A that is repeated.

-What is returned as a result of the call mystery(8,3)?