1. Use amortized analysis to find the asymptotic time complexity of this code in terms of n. Express the answer using notation. ``sqrt" means square root.

 #include #include #include #include #include #include #include /* printf, scanf, puts, NULL */ #include /* srand, rand */ #include #include using namespace std; int main() { int n; cin >> n; int m = 0; for(int t = 0; t < n; t++) for(int i = 0; i < sqrt(t) and m < n; i++) m++; return 1; }