solve the question of book Analysis of algorithm please

Find the maximum flow in the following graph using Ford-Fulkerson method. V={0, 1, 2, 3, 4, 5} and E={(0, 1, 10), (0, 2, 7), (1, 2, 6), (1, 3, 4), (2, 1, 4), (2, 4, 12), (3, 2, 9), (4, 5, 4)}. Note: Numeric value is the weight of the corresponding edge and 0 vertex is the source and 5 vertex is the sink