How is Greedy Algorithm A described for optimization problems?

How is Greedy Algorithm A described for optimization problems?

• A. Repeatedly choose the job assignment with the lowest cost among all n−i+1 possible assignments; assign that job; remove that pair from consideration.
• B. Solve the problem exactly using dynamic programming.
• C. Randomly assign jobs to employees.
• D. Build a solution by maximizing the total cost at each step.

Answer: (D)