Consider a network G = (V, E), s, t in V, c(e) for e in E. If the flow f = 0 for all edges in E, what can be inferred about the flow?
a) It's maximal
b) It's minimal
c) It's zero everywhere
d) It's undefined