Determine the big-Oh complexity for the algorithm below. cin >> N; for (I = 1; I > X; Q.Push(X); } Q.Push(X); while (!Q.Empty()) do {

Determine the big-Oh complexity for the algorithm below.

cin >> N;

for (I = 1; I <= N; I++)

{

cin >> X;

Q.Push(X);

}

Q.Push(X);

while (!Q.Empty()) do

{

Q.Pop(X);

if (X < 0)

Q.Pop(X);

}