The manager assigns tasks to workstations and breaks tes using a longest operation heuristic. That is, if two or three tasks could be assigned to a given station, the manager assigns the longest task first and then fills in the remaining time at the workstation as completely as possible. Using this approach, what task(s) would be assigned at the fourth station? A. N,P B. M C. 0,P D. N,O