Create a Java program that accepts the input of a list of words from the user and stores them into a String array. Then, the program outputs those words and the count of how many times each word appears in the array. The user's input should begin with the number of words to be stored in the array. You can assume that the input will always contain fewer than 20 words.

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?

Whats three fourths of 15(this is supposed to be in math but i clicked too fast)