Peter Johnson, the CFO of Homer Industries, Inc is trying to determine the Weighted Cost of Capital (WACC) based on two different capital structures under consideration to fund a new project. Assume the company’s tax rate is 30%. Component Scenario 1 Scenario 2 Cost of Capital Tax Rate
Debt $5,000,000.00 $2,000,000.00 8% 30%
Preferred Stock 1,200,000.00 2,200,000.00 10%
Common Stock 1,800,000.00 3,800,000.00 13%
Total $8,000,000.00 $8,000,000.00

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