Greedy Algorithm B for optimization problems is described as which approach?

• A. for i = 1 to n: select the lowest-cost assignment among all n^2, (n−1)^2, ..., 1^2 possibilities; assign that job; remove that employee and that job from their respective sets.
• B. for k = n^2, (n−1)^2, ..., 1^2: choose the highest-cost assignment among all k possibilities; assign that job; remove that employee and that job.
• C. for k = n^2, (n−1)^2, ..., 1^2: choose the lowest-cost assignment among all k possibilities; assign that job; remove the employee only.
• D. for k = n^2, (n−1)^2, ..., 1^2: select a random assignment; assign; remove.

Answer: (B)