This code snippet contains a set of nested loops that display 10 rows of # characters. there are 15 # characters in each row, with a space between each #. fill in commented lines 2 and 3 to result in the specified output. for row in range(10): # write the nested loop clause# write the print statement for the inner #s print()

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