Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem