Algo doubt

Let A[1, …n] be an array storing a bit (1 or 0) at each location, and f(m) is a function whose time complexity is Θ(m). Consider the following program fragment written in a C like language:

counter = 0;
for (i=1; i<=n; i++)
{ if a[i] == 1) counter++;
else {f (counter); counter = 0;}
}


The complexity of this program fragment is

1. Ω(n2)

2. Ω(nlogn) and O(n2)

3. Θ(n)

4. o(n)