Event Scheduler Conflicts

Consider a system that manages events represented by time intervals. Each event is given as a pair of integers (start, end) where the start time is inclusive and the end time is exclusive. Your task is to write a function that takes a list of events and returns:

1. A boolean indicating whether any events conflict with each other (i.e., if any two events overlap).

2. The maximum number of events that are overlapping at any point in time.

For example, given the events:

[(1, 4), (2, 5), (7, 9)]

Your function should return (true, 2) because there is an overlap between the first two events, and the maximum number of concurrent events is 2.

Additional considerations:

• If one event ends exactly when another begins, they should be considered non-overlapping.
• The list of events might not be sorted by their start times.
• Aim for an efficient solution that will handle a large number of events.

Implement your solution in a programming language of your choice.