For a flow network G = (V, E) with specified s,t E V and capacities ce > 0 for e E, you are given a flow f (you are given fe for every eE E) Note: For both parts, faster and correct - is worth more credit. And if you're algorithm takes the same time as computing a max-flow from scratch then you'll get 0 points. Part (a): Explain an algorithm to verify/check whether or not fis a valid flow. Be sure to state and explain the running time of your algorithm. Part (b): It is claimed that f is a maximum flow. Explain an algorithm to verify/check whether or not f is a maximum flow. Be sure to state and explain the running time of your algorithm. For a flow network G = (V, E) with specified s,t E V and capacities ce > 0 for e E, you are given a flow f (you are given fe for every eE E) Note: For both parts, faster and correct - is worth more credit. And if you're algorithm takes the same time as computing a max-flow from scratch then you'll get 0 points. Part (a): Explain an algorithm to verify/check whether or not fis a valid flow. Be sure to state and explain the running time of your algorithm. Part (b): It is claimed that f is a maximum flow. Explain an algorithm to verify/check whether or not f is a maximum flow. Be sure to state and explain the running time of your algorithm