Stooge sort is a "bad" recursive sorting algorithm. given an array a, the algorithm can be defined as follows: step 1: if the value at the leftmost position of the array is larger than the value at the rightmost position then swap values. step 2: if there are 3 or more elements in the array, then:  recursively call stooge sort with the initial 2/3 of the array.  recursively call stooge sort with the last 2/3 of the array.  recursively call stooge sort with the initial 2/3 of the array again. give a recurrence for the number of comparisons executed by the stooge sort algorithm. solve the recurrence to determine the theoretical running time of the stooge sort algorithm.

Write a full class definition for a class named player , and containing the following members: a data member name of type string .a data member score of type int .a member function called setname that accepts a parameter and assigns it to name . the function returns no value.a member function called setscore that accepts a parameter and assigns it to score . the function returns no value.a member function called getname that accepts no parameters and returns the value of name .a member function called getscore that accepts no parameters and returns the value of score .this is what i have, aparently this is wrong: class player{private: string name; int score; public: void player: : setname (string n){name =n; }void player: : setscore (int s){score = s; }string player: : getname (){return name; }int player: : getscore (){return score; }};