In Greedy Algorithm A, after selecting the lowest-cost assignment, what is done next?

• A. Remove that employee and that job from their respective sets.
• B. Recompute all costs.
• C. Append to final solution and stop.
• D. Backtrack to the previous step.

Answer: (A)