If an Algorithm's running time can be expressed as function F(x)=√n+(logn)^2 , : If an Algorithm's running time can be expressed as function F(x)=√n+(logn)^2 , Then which one of the following is not a correct bound for the running time ? 
1-O(n)
2-O(√n)
3-O((log)^2)
4-Omega(1)
