C++ function

1. Modify the function to count the number of operations performed when the function executes. Some questions will specify whether this is for the worst or best case. See the section on counting operations below for more detail.

2. Determine a detailed cost function for the function. This function should be written in the form wnx + yn + z where w, x, y and z are real numbers and n is a variable referring to the size of the function's input. If necessary, you should adapt this format to include other terms such as log2(n).

3. Identify (one of) the barometer operations for the function.

4. Identify the O notation running time of the function.

Question 5 This function is a recursive version of selection sort. 1/ PARAM: arr is array to be sorted, n is size of array, i should initially = 0 void ssort(int arr[], int n, int i) if (i