solve 4 number with full step

8 4. Find the maximum flow from source (node 0) to destination (node 5) from the following flow graph. Show the residual network at each step. 12 16 20 10||4 13 2 14 6+4 5. a) Define the following and show the relationship among them: (0) Polynomial time problems (ii) NP Hard Problems (iii) NP-Completeness. b) Why Dijkastra's Algorithm does not work with negative weight edges