Assume we need to allocate N tasks onto M CPU cores, and use static priority based scheduling on every core (scheduling on different cores are independent). Please answer the following:

(a) How many different options do we have in task allocation?

(b) Assume after allocation, there are (N1, N2, ..., NM) tasks on each core. How many different options do we have in task scheduling?

(c) Please describe an algorithm for finding a feasible task allocation and scheduling solution (no need to implement the algorithm; pseudo code description is preferred but clear English description is also fine).