Java Time Complexity

Determine the time complexity of the following code snippets using the Landau Symbol O

1. if ( x < 0) { return -1; } if ( x > 0) { return 1; } return 0;

2. for (int i = 0; i < n ; i ++) { for (int j = 1; j < n ; j = j * 5) { System . out . println ("Hi"); } for (int k = 1; k < n ; k ++) { System . out . println (" Hello "); } }

3. for (int i = 0; i < n ; i ++) { for (int j = 1; j < n ; j = j * 2) { if (j - i > n ) { for (int k = 1; k < n ; k ++) { System . out . println (" Hello "); } } else { System . out . println ("Hi"); } } }