Give correct answer with explaination. Dont provide AI generated answer.

3. Assuming a graph can be indicate as (V,E) and graph cut can remove a set of edges to partition a graph. We define Normalized Cut as NCut(A,B)=assoc(A,V)cut(A,B)+assoc(B,V)cut(A,B), where AB=V and AB=. The cost of the cut cut(A,B) is sum of weights of cutting edges where cut(A,B)=pA,qBwpq.assoc(A,V) is sum of weights of all edges that touch A, while assoc(B,V) is sum of weights of all edges that touch B. If we use normalized cut to partition the graph below, which of the following(s) achieve(s) the best result? (a) NCut(a,bcd) (b) NCut(b,acd) (c) NCut(c,abd) (d) NCut(d,abc) (e) NCut(ab,cd)