Can you provide an example of a minimum cut in a graph?

A minimum cut in a graph is a set of edges that, when removed, disconnects the graph into two separate components. An example of a minimum cut in a graph is shown in the image below:

Image of a graph with a set of edges highlighted that, when removed, disconnect the graph into two separate components