Determine the big O complexity for the following function, which represents the number of steps required for some algorithm: T(n) = 5(log(n))2 + 8n * log(n) + 16nv(n) + n(n-1) 25 O O(n * log(n)) O O((log(n))2) . O(na) O O(n) O Onvn)