How to solve?.show step by step

(b) Figure 1 shows the nodes connecting the sink (origin node) and the tank (destination node). Evaluate the maximum flow that can be sent from sink to tank by passing through all the nodes using Augmenting Path Algorithm. [Rajah 1 menunjukkan nod yang menghubungkan sinki (nod asal) dan tangki (nod destinasi). Ukurkan aliran maksimum yang boleh dihantar dari tenggelam ke tangki dengan melalui semua nod menggunakan Algoritma Path Augmenting. (7 Marks/Markah) 10 15 6 12 10 Sink Tank 10 18 5 H 17 10 13 Figure 1 [Rajah 1]