Show that if a network contains no directed path from the source to the sink , then the maximum possible total flow on (for any flow function) is .

I am not sure how to prove this. I know I want to use themax flow min cut theoremthat would show that the value of a maximum flow and the capacity of a minimum cut are both zero. So, I need some help with this one. Thanks in advance.