Give the tightest bound on the runtime of each code fragment. Written in Java. I'm using big 0, big Theta and big omega notation

--------------------------------------------

int n, m;

for(int i = 0; i < n; i++){

for(int j = 0; j < m; j++){

System.out.println(i + j);

} }

--------------------------------------------

int n, m;

for(int i = 0; i < n; i++){

System.out.print("hi");

}

for(int j = 0; j < m; j++){

System.out.print("hi");

}

--------------------------------------------

int n;

for(int i = 0; i < n; i++){

for(j = 0; j < i * i; j++){

System.out.println("Hello World");

}

}