Big-Oh Questions

1. Derive the cost function for the algorithm. 2. State the complexity of the algorithm in Bigo 3. Prove that the derived cost function is in the stated order (big-Oh) Problem 0: Reverse input: vals[n] output: vals reversed for i -0... n/2 -vals[i] vals[i] vals [n-i-1] vals [n-i-1-t return vals