a series of lectures that you would like to attend. Each lectur 2. There is e i has a start time si and an end time ej. To attend a lecture, you must attend the whole thing, and you can only attend one lecture at a time. Your goal is to maximize the number of lectures that you attend. Design a greedy algorithm to find the number of lectures that you can attend. Hint: Consider the ending times of each lecture. If you pick a lecture that ends at time t, which other lectures are vou still able to attend? If vou can choose a lecture that ends sooner or a lecture that ends later, which gives you more freedom for later selections? The algorithm that I am looking for here follows the simple rule of at each step, selecting the lecture that has the earliest ending time (and of course, don't pick anything that interferes with your past choices)