Minimum Conference Rooms

You are given an array of events, where each event is represented as a tuple (or an object) containing a start time and an end time. Your task is to write a program that computes the minimum number of conference rooms required to schedule all the events such that no two events in the same room overlap in time.

For example, consider the following events:

• Event 1: starts at 9:00 and ends at 10:30
• Event 2: starts at 9:15 and ends at 10:00
• Event 3: starts at 10:00 and ends at 11:00
• Event 4: starts at 10:30 and ends at 12:00

Your program should determine that at least 2 rooms are needed to accommodate these events.

Requirements:

1. Define the appropriate data structure to represent the events.
2. Ensure your solution works with varying input sizes, including edge cases such as events that exactly touch (the end time of one is the start time of another).
3. The input events may not be in any particular order; consider sorting or processing them as needed.
4. Optimize your solution for efficiency.

Write a complete program or function in your preferred programming language that solves the problem as described.