Question 01: Complexity Analysis Consider the following method one.

Question 01: Complexity Analysis Consider the following method one. public static int one(int n)\ int x-0; for(int i-n*n; j>0; j-2) x +twoi); //statement 1 else for(int j-ij-iitt) x +three(i); return X:; public static int two(int n)\ int x-0; for(int i- n; i>n/2; i-) ://statement 2 return ntx public static int threefint n)i int x-0; for(int i-l; i