Merge Overlapping Intervals Problem Statement

Given a specified number of intervals, where each interval is represented by two integers denoting its boundaries, the task is to merge all overlapping intervals and return the list of merged intervals sorted in ascending order of their starting times.

Explanation:

Two intervals are considered overlapping if the starting integer of one interval is less than or equal to the finishing integer of the other interval, and greater than or equal to the starting integer of the same interval.

Input:

Number of test cases, T Each test case includes: N - the number of intervals, followed by two lines: the starting integers and the ending integers of each interval.

Output:

For each test case, output the merged intervals, each on a new line, with intervals represented by two space-separated integers denoting the start and end times.

Example:

Given the intervals: [1,4], [3,5], [6,8], [10,12], [8,9] Merge as follows: [1,4] overlaps [3,5] to form [1,5], [6,8] overlaps [8,9] to form [6,9]. Non-overlapping interval: [10,12] Result: [1,5], [6,9], [10,12]

Constraints:

• 1 <= T <= 100
• 1 <= N <= 1000
• 0 <= start, finish <= 10⁹

Note: Implement the function to handle the merging of intervals as specified.