$6\mathrm{.}12\mathrm{.}21$: Assigning tasks to processors.

As set of $30$ tasks are assigned to a set of $10$ processors. The processors are all

distinct. Each task is assigned to exactly one processor. A processor can be assigned

more than one task.

$($b$)$ How many ways are there to assign the tasks if the tasks are all identical and there

are no restrictions on the number of tasks that can go to any particular processor?