Characterize the function T(.) that would characterize the running time of your code. Then show Big O, Big Omega and Big Theta complexity of your algorithm. For each case, show the appropriate n0 and c values that would satisfy the conditions.

void twoSum(int n, int n) { for(int i = 0; i > file name; ifstream file (file_name); if(!file) { return 1; } clockt start, end; time (&start); string meta_data; getline (file, meta_data); int num_n = stoi (meta_data.substr(0, meta_data.find(' ')); int n = stoi (meta_data.substr(meta_data.find(' ')+1, meta_data.size())); string line; while (getline (file, line)) { int n[n]; int i = 0; while(true) { if(line.find(' ') != string: : npos) { int val = stoi (line.substr(0,line.find(' '))); n[i] = val; line = line.substr(line.find(' ')+1, line.size(); i++; } else { int val = stoi (line.substr(0, line.size()); n[i] = val; i++; break; twoSumin, i); end = clock(); double time_taken = double (end - start) / double (CLOCKS_PER_SEC); cout