A cut in a network is a partition of v into s and t (where t=v−s) such that:
a) s is the target and t is the source
b) s is in t and t is in s
c) s is the source and t is the target
d) s is in s and t is in t