Please help with this practice question:

Given a simple undirected connected graph G, min cut problem is to partition the vertices of G into two sets A and B such that the number of edges between A and B is minimum. Propose a simple randomized algorithm to solve this problem.

Any randomized algorithm can be used to solve the question.