$6\mathrm{.}1\mathrm{.}25.(!)$ Prove that every $n-$vertex plane graph isomorphic to its dual has $2n-2$ edges. For all $n4,$ construct a simple $n-$vertex plane graph isomorphic to its dual.