1. Find the complexity of the algorithm as Big O notation: countValue(a, n, val) \{ count=0 for i=1 to n{ if (a[i]=val) count=count+1 \} return count \}