Answer questions 2 to 4 of the General Requirements for both the worst-case and best-case running times of the function, and 3. Describe, and give examples of input that constitutes the best and worst case for the algorithmAnswer questions 2 to 4 of the General Requirements for both the worst-case and best-case running times of the function, and 3. Describe, and give examples of input that constitutes the best and worst case for the algorithmAnswer questions 2 to 4 of the General Requirements for both the worst-case and best-case running times of the function, and 3. Describe, and give examples of input that constitutes the best and worst case for the algorithmDetermine the running cost time of the following function in the form of 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 and the running time in Big O notation.

// PARAM: arr is array from which duplicates are to be removed, n is size of array

vector removeDuplicates(int arr[], int n)

{

vector result;

int i = 0;

while (i < n) {

int iResult = 0;

bool duplicate = false;

while (iResult < (int)result.size() && !duplicate) { //note 4

if (arr[i] == result[iResult]) {

duplicate = true;

}

iResult++;

}

if (!duplicate) {

result.push_back(arr[i]); //note 4 }

i++;

}

return result; }