What will be the output for the following code? #include #include void combination(int arr[], int aux[], int start, int end, int index, int r); int compare (const void * a, const void * b) return ( *(int*)a - *(int*)b ); void print(int arr[], int n, int r) int aux[r]; qsort (arr, n, sizeof(int), compare); combination(arr, aux, 0, n-1, 0, r); void combination(int arr[], int aux[], int start, int end, int index, int r) if (index == r) for (int i=0; i = r-index; i++) aux[index] = arr[i]; combination(arr, aux, i+1, end, index+1, r); while (arr[i] == arr[i+1]) i++; int main() int arr[] = 1, 2, 2; int r = 2; int n = sizeof(arr)/sizeof(arr[0]); print(arr, n, r);

Answer: Option C