The deterministic algorithm supplies an admissible cut and a feasible arc flow. Public arc-to-path conversion puts its value in the feasible set defining $maxFlow$; the boundedness lemma makes that value at most the supremum. The admissible cut bounds the infimum defining $sparsestCut$, yielding the classical inequality with the algorithm's same universal approximation constant.