A group from the class in the previous question has identified a bug in their code that will take a minimum of 16 tasks T = {t1...t16} to resolve. How many ways are there to assign the tasks if (5 points each) (a) the tasks are distinguishable? (b) the tasks are indistinguishable? (c) the tasks are distinguishable and each group member completes the same number of tasks? (d) the tasks are indistinguishable and each group member completes the same number of tasks?