What is the time complexity of the following code? #include using namespace std; void convert(int arr[], int n) int temp[n]; memcpy(temp, arr, n*sizeof(int)); sort(temp, temp + n); unordered_map map; int sort_index = 0; for (int i = 0; i < n; i++) map[temp[i]] = sort_index++; for (int i = 0; i < n; i++) arr[i] = map[arr[i]]; void printArr(int arr[], int n) for (int i=0; i<n; i++) cout << arr[i] << " "; int main() int arr[] = 10, 20, 15, 12, 11, 50; int n = sizeof(arr)/sizeof(arr[0]); convert(arr , n); printArr(arr, n); return 0;

Answer: Option C