Aldhurst Corp., a software manufacturing firm in Lochmount, a European country, bought Fairden Corp., a software manufacturing firm in Vertholt, an Asian country. This scenario is an example of .

What is the worst-case complexity of the maxrepeats function? assume that the longest string in the names array is at most 25 characters wide (i.e., string comparison can be treated as o( class namecounter { private: int* counts; int nc; string* names; int nn; public: namecounter (int ncounts, int nnames); int maxrepeats() const; }; int namecounter: : maxrepeats () { int maxcount = 0; for (int i = 0; i < nc; ++i) { int count = 1; for (int j = i+1; j < nc; ++j) { if (names[i] == names[j]) ++count; } maxcount = max(count, maxcount); } return maxcount; }

In a word processing program, such as microsoft word, which feature to you choose the desired picture enhancement?

Worth 50 points answer them bc i am not sure if i am wrong