Consider the algorithm 

algorithm name: qx

input :

n: a number

x: a number

a: an array from a[1] to a[n]

output : i: a number related to a and x

side effect: N.A.

plan

1. i := 0

2. While (a[i] != x and i < n)

3. i++

End of algorithm

1) What is the input size of the algorithm in big O notation?

2) What is the best case running time of the algorithm, in big O notation? Specify the best case.

3) What is the worst case running time of the algorithm, in big O notation? Specify the best case.