Merge Overlapping Events

Problem Description

You are given a list of events, where each event is represented as an object with a start and end time in 24-hour format (e.g., 09:00, 13:45). Note that events may overlap. Your task is to write a function that merges these overlapping events into consolidated time blocks and returns a sorted schedule based on start times.

Requirements:

• Write a function that accepts an array of event objects. Each object has a start and an end property, both represented as strings in the HH:MM format.
• Merge any events that overlap. Two events overlap if one event's start time is less than or equal to the other event's end time.
• Return an array of consolidated event objects sorted by their start time.

Bonus:

Today's date is 2025-02-07. If the first consolidated event starts before 12:00 (i.e., in the morning), mark it accordingly by, for example, adding a field or logging an appropriate message.

Input Example

[
  {"start": "09:00", "end": "10:30"},
  {"start": "10:15", "end": "11:00"},
  {"start": "11:30", "end": "12:30"},
  {"start": "12:00", "end": "13:00"}
]

Output Explanation

After processing the above input, your function should return a consolidated list of events where any overlapping events have been merged. If applicable, apply the bonus for events starting in the morning of 2025-02-07.

Write your solution in the programming language of your choice.