Assume there are several solutions for the same problem, with their worst case running time given below.

Which algorithm is the most suitable as the input size n increases?

1. t1(n) = nlgn

2. t2(n) = 11+lgn

3. t3(n) = 65n³+11

4. t4(n) = 999n²+11

5. t5(n) = 7ⁿ

For an algorithm A, its worst case running time is T(n)=12n³ + 6+ n², and its best case running time is T(n)=143+ 2n + 12n². Express its time complexity using the most appropriate asymptotic notations.

Group of answer choices

(n³)

(n³)

O(n³)

(n²)

O(n⁵)

(n)

(n)

O(n⁴)

(nlgn)