This function prints a pattern

General Requirements For each of the functions described in questions 1 to 6 you are to: 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 wn' + 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 logz(n). 3. Identify (one of) the barometer operations for the function. 4. Identify the O notation running time of the function. Note that questions 3 and 5 have additional or different requirements. Counting Operations If the function return type void it should be modified to return the count of its operations; if the function already has a return value, the count should be assigned to an integer reference parameter. This reference parameter should always be the last parameter in the function's parameter list. When counting operations follow these rules. 1. An executable statement (a line of code that ends in a semi-colon) or a comparison counts as one operation regardless of its complexity - see exceptions 2 and 5. Therefore, the statement x = 4; counts as a single operation as does the statement int w = x + y + z;. 2. Exception to 1 - if a statement includes a function call that does not run in constant time its operation count should be the number of operations performed by that function call. This only applies to questions 5 and 6. 3. Note to 1 and 2 - statements that include the output operator ( 0) { pattern(n/2, i); // Print i spaces cout