[guided]We want to apply $\star$ a second time, this time to $\omega_{K^c} = \omega_{p+1} \wedge \cdots \wedge \omega_n$. The basis formula requires us to compute the shuffle sign $\varepsilon(K^c)$ associated with the multi-index $K^c$. Recall that $\varepsilon(K^c)$ is the sign making
\begin{align*}
\omega_{K^c} \wedge \omega_{(K^c)^c} = \varepsilon(K^c) \cdot \omega_g
\end{align*}
hold — that is, the sign required to bring the wedge product on the left into the standard volume-form ordering on the right.
Our first task is to identify $(K^c)^c$. Complementation is involutive, so $(K^c)^c = K = \{1, \ldots, p\}$, and the wedge product spells out as
\begin{align*}
\omega_{K^c} \wedge \omega_{(K^c)^c} = \omega_{p+1} \wedge \cdots \wedge \omega_n \wedge \omega_1 \wedge \cdots \wedge \omega_p.
\end{align*}
Now we need to count: how many adjacent transpositions are needed to bring the right-hand side into the standard order $\omega_1 \wedge \cdots \wedge \omega_n$? Think of it as a sorting problem. Each of the $p$ "small" factors $\omega_1, \ldots, \omega_p$ currently sits to the right of every "large" factor $\omega_{p+1}, \ldots, \omega_n$, and must move past all of them. So $\omega_1$ swaps past $n - p$ factors, then $\omega_2$ swaps past $n - p$ factors, and so on — a total of $p \cdot (n-p)$ adjacent transpositions. Each such swap contributes one factor of $-1$ via antisymmetry of the wedge product, giving
\begin{align*}
\omega_{p+1} \wedge \cdots \wedge \omega_n \wedge \omega_1 \wedge \cdots \wedge \omega_p = (-1)^{p(n-p)} \cdot \omega_1 \wedge \cdots \wedge \omega_n = (-1)^{p(n-p)} \cdot \omega_g.
\end{align*}
Comparing with the defining equation for $\varepsilon(K^c)$, we conclude $\varepsilon(K^c) = (-1)^{p(n-p)}$.
This calculation is the combinatorial heart of the proof. There are two illuminating ways to see why $p(n-p)$ is the correct count. The *inversion-count* viewpoint: writing the permutation
\begin{align*}
(p+1, p+2, \ldots, n, 1, 2, \ldots, p),
\end{align*}
its sign equals $(-1)^{\#\text{inversions}}$, and an inversion is a pair $(i, j)$ with $i$ appearing before $j$ in the listed order but $i > j$. Every pair consisting of one "large" element from $\{p+1, \ldots, n\}$ and one "small" element from $\{1, \ldots, p\}$ is an inversion (the large element precedes the small one), and there are exactly $p \cdot (n-p)$ such pairs.
The *graded-commutativity* viewpoint: the exterior algebra is graded-commutative, meaning $\alpha \wedge \beta = (-1)^{\deg\alpha \cdot \deg\beta} \beta \wedge \alpha$. Setting $\alpha = \omega_{p+1} \wedge \cdots \wedge \omega_n$ (degree $n-p$) and $\beta = \omega_1 \wedge \cdots \wedge \omega_p$ (degree $p$) gives $\alpha \wedge \beta = (-1)^{p(n-p)} \beta \wedge \alpha$, the same sign by a structural argument.[/guided]