Greedy Algorithm Instance:An undirected graph G(V,E). Solution:A bipartition of Vinto S and Tthat maximizes the cut E(S,T)={w,v}∈E|w∈S∧v∈T}. Greedy Cut: initially,S=T=O; fori=1,2,.,n: Vi joins one of S,T to maximize current E(S,T);Greedy Algorithm Instance: An undirected graph . Solution: A bipartition of into and that maximizes the cut . G(V, E) V S T E(S, T) = {{u, v} ∈ E ∣ u ∈ S ∧ v ∈ T} T S Greedy Cut: initially, ; for : joins one of to maximize current ; S = T = ∅ i = 1,2,…, n vi S, T E(S, T)