# Task: Implement Merge Sort Algorithm

Implement the merge sort algorithm in `workspace/sorting.py`.

## Requirements

1. Define a function `merge_sort(items)` that takes a list and returns a new sorted list.
2. The function must implement the merge sort algorithm (divide-and-conquer with merging).
3. It must work with integers, floats, and strings.
4. Handle edge cases: empty list, single-element list, lists with duplicates.
5. The original list must not be modified (return a new list).

## Output

Save the file to `workspace/sorting.py`.
