Consider an undirected graph with $6$ vertices $($labelled A$,$ B$,...,$ F$)$ having the following edges: $($A$,$ B$),$

$($A$,$ C$),($B$,$ C$),($B$,$ D$),($C$,$ D$),($C$,$ E$),($D$,$ F$),($E$,$ F$).$ Apply the randomized min$-$cut algorithm to find the

minimum cut in this graph. Show the steps and the resulting minimum cut. What is the benefit of using a

randomised algorithm for this problem?