Which of the following problems can be solved by a standard Greedy algorithm ?
I. Finding a minimum cost spanning tree in an undirected graph.
II. Finding a maximum clique in a graph.
III. Finding a maximum flow from a source node to a sink node in a directed graph.
A.I, II
B.I,II,III
C.III only
D.I only