Write a simple program that tests your extrasensory perception! The program randomly selects a color from the following list of words: Red, Green, Blue, Orange, and Yellow. To select a word, the program could generate a random number. For example, if the number is 0, the selected word is Red; if the number is 1, the selected word is Green; and so forth.

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; }