Manny has drafted an email message and configured a delivery option “Do not delivery before 5:00 PM and today’s date” he shuts down his computer and leaves for the day at 4:30 pm. What will happen at 5 pm? - the message will be delivered from the server
- the message will be delivered from Manny’s computer
- the message will remain in manny’s outbox until the computer is started and the outlook programs is started the next day
- the message will remain in Manny’s outbox until the computer is started and he will be promoted

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

4. what is the reason for including the following code snippet in the header file animal.h? #ifndef animal_h #define animal_h class animal { public: animal(); animal(double new_area_hunt); void birth(); void hunt(double new_area_hunt); void death(); double get_area_hunt() const; private: double area_hunt; }; #endif

How can improving one’s reasoning skills also improve one’s performance on the job?