In this offline, you will need to solve the Activity Selection Problem with the greedy approach.
Randomly generate a bunch of activities with their start and end times. Then find out all possible maximum-size subset of mutually compatible activities.
