3. For each of the following statements, either give a counter-example to show that the statement is false or a short proof explaining why it is true. Let f be a maximum flow in a flow network and e an edge in the network with capacity ce>0. 1 (a) (1 point) If e is in a minimum cut, then f(e)=ce. (b) (1 point) If e is in a minimum cut, then increasing ce, will increase the value of the maximum flow. (c) (1 point) If e is in a minimum cut, then deleting e, will decrease the value of the maximum flow