which of the following is not true about greedy algorithms? A.It makes the locally optimal choice at each stage B.A greedy strategy produces an optimal solution C. A greedy algorith exists for constructing the minimum spanning tree D.A greedy algorithm exists for partition a set of n weights into k buns where each has the same weight E. Greedy algorithm exists for some NP-hard problems.

which of the following is not true about greedy algorithms? A.It makes the locally optimal choice at each stage B.A greedy strategy produces an optimal solution C. A greedy algorith exists for constructing the minimum spanning tree D.A greedy algorithm exists for partition a set of n weights into k buns where each has the same weight E. Greedy algorithm exists for some NP-hard problems.