Analyze these functions. For each function, give the complete T(n) (or T(m,n), or whatever is appropriate), then find the tightest time complexity you can, in big-Oh notation. You need not show every step in getting from T(n) to big-Oh. You should assume all inputs are > 0.

TIMES int f1(int n) { int i = 1; for (int j = 1; // COST // c1 // c2 // c3 // C4 j++) { i = i* j; return i; TIMES int f2(int m, unsigned int n) { for (int i = %; i ; j--) { return j; return 0; TIMES void f3(int n) { for (int i = 0; i= 0; j--) { System.out.print("i " + i); System.out.println(", j = " + i); // COST // ci // c2 // c3 // c4 // c5 // c6 // C7 // c8<>