deterministic algorithm for find the exact min-cut of a graph if it’s at most 2

Give a deterministic algorithm for computing the exact min-cut of a graph if it’s
at most 2. If the min-cut is bigger than 2, the algorithm should output "bigger
than 2".

DreamProxies - Cheapest USA Elite Private Proxies 100 Private Proxies 200 Private Proxies 400 Private Proxies 1000 Private Proxies 2000 Private Proxies ExtraProxies.com - Buy Cheap Private Proxies Buy 50 Private Proxies Buy 100 Private Proxies Buy 200 Private Proxies Buy 500 Private Proxies Buy 1000 Private Proxies Buy 2000 Private Proxies ProxiesLive Proxies-free.com New Proxy Lists Every Day Proxies123