Suppose we have an arrayAofnprofessors; each teacher has two characteristics: difficulty (a numberin the range [0,10], where a higher number indicates a more difficult teacher) and humor (a number inthe range [0,100], where a higher number indicates a funnier teacher). You may assume that each valueis distinct (no two professors are exactly as difficult or exactly as funny). Our goal is to determine aset of professors that might satisfy an answer to the question "who is the easiest teacher that is thefunniest?" Our goal is to avoid professors with high difficulty and low humor. We would like to find thelargest subset of A such that no professor in the chosen subset isbothless funnyandmore difficultthan another professor in the set.
For example, if our dataset is:
Professor Difficulty Humor
Jones Jr 4 65
Ryan 8 15
Grant 2 35
Moriarty 10 0
Plum 9 85