Given the following segments of code, determine their asymptotic (bigTheta) runtimes in terms of n. For part c, only give the runtime of mysteryThree(int n)

(a) public void mysteryOne(int n) { int sum = 0;

 for (int i = n; i >= 0; i--) { if ((i % 5) == 0) { 

 break; } else { 

 for (int j = 1; j < n; j*=2) { sum++; 

} }

} }

(b) public void mysteryTwo(int n) { int x = 0;

 for (int i = 0; i < n; i++) { for (int j = 0; j < (n * (n + 1) / 3); j++) { 

x += j; }

} }

(c) public void mysteryThree(int n) { for (int i = 0; i < n; i++) {

 printCats(n); } 

}

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

 System.out.println("catsmoop"); } 

}