I need the step by step solution on how to solve this problem

Find the maximum flow (from the source s to the sink ) in the following network using the Edmonds-Karp algorithm. At the very least, please show which path you select and the resulting augmented network after you incorporate the path's flow. Then identify the minimum capacity cut on this network after you find the maximum flow. The network shown below has capacities labeled on the edges. 3 OO 10 5 5 | 5 2 2