Given a discrete graph with set of vertices V and set of edges G, mincut is a split of V into two disjoint non-empty sets V1 and V2, such that set {(u,v)|(u,v)∈G, u∈V1, v∈V2} has minimal size. Or a friendly explanation, remove the least amount of edges possible so that the graph falls…