Create a class named lease with fields that hold an apartment tenant’s name, apartment number, monthly rent amount, and term of the lease in months. include a constructor that initializes the name to "xxx", the apartment number to 0, the rent to 1000, and the term to 12. also include methods to get and set each of the fields. include a nonstatic method named addpetfee() that adds $10 to the monthly rent value and calls a static method named explainpetpolicy() that explains the pet fee as folows: a pet fee of $10 is added to the monthly rent.

Aprovides legal protection for something an individual has created

The pyraminx is a rubik's cube-type toy in the shape of a tetrahedron (not a pyramid). the pyraminx shown below has edges 15\,\text{cm}15cm15, space, c, m long and vertical height h=12.2\,\text{cm}h=12.2cmh, equals, 12, point, 2, space, c, m. the triangle drawn with dashed lines is a right triangle. what is the distance rrr? round your answer to the nearest tenth.

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