A deterministic near-linear time algorithm for finding minimum cuts in planar graphs