Question $4(1$ point$)$

What's the best way to describe what $O(n)$ means?

If the input size is $n,$ the algorithm takes $n$ milliseconds to execute

If the input size is $n,$ the algorithm executes $n$ instructions

The execution time is constant

There is a linear relationship between size of input and execution time

Question $5(1$ point$)$

Consider a variation of linear search where we are guaranteed that the input vectors alternates odd and even numbers $($e$.$g$.,[5,8,23,6,71,100].$ What is the appropriate way to describe the worst$-$case complexity of the algorithm in this case?

$O(n)$

$\frac{n}{2}$

$O(1)$

$O(\frac{n}{2})$