Task Dispatcher

You are given a list of tasks, where each task is represented by a positive integer indicating its processing time, and an integer M representing the number of available servers. Each task must be assigned to exactly one server. Your goal is to distribute the tasks among the servers such that the maximum load (i.e. the sum of processing times) on any server is minimized.

Write a function that receives the list of tasks and the number of servers, and returns either the minimized maximum load or an assignment (a list of M lists of tasks) that achieves this minimized maximum load.

Example:

Input: tasks = [4, 2, 7, 8, 1, 4], M = 3
Possible Output (assignment): [[8, 1], [7, 2], [4, 4]]
The maximum load in this assignment is 9.

Details:

• The tasks array can have up to 10^4 tasks.
• Each task has a processing time between 1 and 10^4.
• 1 ≤ M ≤ (number of tasks).

Design and implement an efficient approach to solve this problem.