Consider the following code fragment: int count = 0; for (in…
Consider the following code fragment: int count = 0; for (int i = 0; i < n; i++) count += 1; for (int j = 0; j < n; j++) count += 1; return count; What is the time complexity of this code?