How do we do this

What is the tightest (the slowest growth) Big-O complexity of the following recurrence relation? T T() = + c, n> 1 C, n void method (T[] input){ Arrays.sort(input); } } will not compile compile, but will generate an exception when run will never terminate (infinite loop) will compile and run without throwing exceptions