Suppose that you are going to a conference, and have a set of seminars to select from. Each seminar occurs at a specific time (e. g., 1:00pm - 2:00pm). If two seminars overlap in time, you cannot participate in both of them. Your goal is to go to as many seminars as possible. For example, suppose there is a talk on algorithms from 1pm-2pm, a talk on OS from 1:30pm - 3pm, a talk on programming languages from 2pm-4pm, a talk on data structures from 2:30pm - 3:30pm, and a talk on compilers from 3:30pm - 5pm. You can do algorithms, data structures, and compilers. It is not possible to do more than three seminars given this particular set of times.

Required:
Design an efficient greedy algorithm to select non-overlapping seminars so that the number of seminars is maximized. Your algorithm should return the actual seminars selected, not just the number of seminars.