$1)$

What is the primary advantage of greedy algorithms?

$(1$pts$)$

Question $1-$ What is the primary advantage of greedy algorithms?

They work well for problems with overlapping subproblems.

They are simple to implement and understand.

They have a polynomial time complexity for all problems.

They guarantee the optimal solution for all problems