Take the Activity Selection problem and consider the case where you have a positive integer m number of rooms, call them R1, R2, . . . , Rm, along with n activities to schedule. The Multiroom Activity Selection problem is to schedule each activity in at most one room in such a way that every pair of activities assigned to the same room are compatible; in particular, some activities may not be assigned to any room. You are to maximize the total number of activities scheduled. Please answer all parts! A. Develop a greedy algorithm that will give an optimal solution (maximize the total # of activities scheduled) for this problem. B. What is the asymptotic time complexity of the algorithm created in part A as a function of n and m? C. State a theorem of optimality for this algorithm and prove it using a substitution argument. For this part only, you should assume that m = 2.