You would like to attend Comic$-$Con at San Diego. The whole event starts at day one

and finishes at day T and you plan to attend it everyday. There are n small events

e$1,...,$ en that take place during Comic$-$con. Each event ei takes place on specific days

$($not necessarily consecutive, for example small event one may happen on days $1,3,6).$

Each day you can attend at most three small events from e$1,...,$ en$.$ Design an algorithm

that maximizes the number of different small events you can attend. What is the running

time of your algorithm?