Write a game program that prints a chart to the screen showing the randomness of a die. The game should first promp the client for anumber of die throws that he would like. The game then throws the die that many times. The game then prints a chart showing a line of asterisks for each die number, indicating the number of times the die landed with that face number on top. If the die behaves in a truly random fashion, each chart will look a little different, reflecting the randomness of the die. Allow the client to repeat the game as times as she wished

Acase study allows a more detailed look at the life of a single subject than any other study.

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

What did creator markus “notch" persson initially call his game