You are given two arrays of length n:

employees: an array of employee names (strings).

experience: an array of distinct positive integers representing each employee's years of experience.

For each index i, each employees[i] corresponds to experience[i].

Return the employees array sorted in descending order based on experience.

Note:

You must implement the sorting using the Merge Sort algorithm.

Do not use any built-in sorting functions.

Example 1:

Input:
  employees = ["Kate", "Liam", "Olivia", "Noah", "Emma", "James"];
  experience = [2, 8, 9, 5, 3, 7];
Output: ["Olivia", "Liam", "James", "Noah", "Emma", "Kate"]
Explanation: Since "Olivia" has the longest work experience (9), she appears first, followed by Liam (8), and so on.

Example 2:

Input: 
  employees = ["Alice", "Bob", "Charlie", "David"]; 
  experience = [5, 3, 2, 7];
Output: ["David", "Alice", "Bob", "Charlie"]
Explanation: David has the most experience, followed by Alice, and so on.

Constraints

n == employees.length == experience.length

1 <= n <= 10³

1 <= employees[i].length <= 20

1 <= experience[i] <= 10⁵

employees[i] consists of lower and upper case English letters.

All the values of experience are distinct.

28. Sort Employees by Experience (Merge sort)