Event Profit Maximization

You are organizing a conference and have a list of potential events, where each event is represented as a tuple or object with three properties:

• start: the start time of the event (an integer or a comparable time unit)
• end: the end time of the event (an integer or a comparable time unit)
• profit: the profit gained by hosting the event

The conference hall can only host one event at a time. Two events are considered non-overlapping if the end time of one is less than or equal to the start time of the other.

Problem Statement:

Design and implement a function that takes an array (or list) of events and returns the maximum total profit you can achieve by selecting a subset of non-overlapping events.

Requirements:

• Your solution should be efficient in both time and space complexity as the number of events can be very large.
• Consider edge cases, such as events with the same start or end times.
• Clearly structure your code and include comments explaining your logic.

Example:

For an input of events like:

[(1, 3, 50), (3, 5, 20), (0, 6, 100), (5, 7, 30), (8, 9, 40), (5, 9, 60)]

One possible selection of non-overlapping events might yield a total profit of 150. (The exact selection depends on your implementation.)

Note: Do not include any additional output or if/when you are testing your code, ensure only the intended return value is printed or returned.

Good luck!