Data Structures and Algorithms:

Computer Science Java.

Please show the steps how the answer is obtained and justify the reasoning.

What is the cost function for the following algorithm? input: vals[n] output: median value of vals for i = 0 ... n / 2 for j = 0 ... i if vals[j] > vals [n - i - 1] t = vals[j] vals[j] = vals[n - i - 1] vals[n - i - 1] = t return vals [n/2] 5n+2 (9/4)n + 5 n^2 +5n + 2 19/4)n^2 + 5n + 2 O