For fixed non-negative integers $n$ and $q \geq 2$, the $k$-th Krawtchouk (Kravchuk) polynomial is defined as $$K_k = \sum_{j=0}^k (-1)^j (q-1)^{k-j} \binom{X}{j} \binom{n-X}{k-j} \in \mathbb{Q}[X]$$ The definition is based on generalized binomial coefficients $$\binom{a}{b} = \frac{a \cdot (a-1) \cdot \ldots \cdot (a-b+1)}{b!}$$ where $b\in\mathbb{N}$ and $a$ comes from any ring ($\mathbb{Q}[X]$ in our case) containing the rationals.
Question
The Wikipedia page lists two alternative expressions for $K_k$:
$$K_k = \sum_{j=0}^k (-q)^j (q-1)^{k-j} \binom{n-j}{k-j}\binom{X}{j}$$
$$K_k = \sum_{j=0}^k (-1)^j q^{k-j} \binom{n-k+j}{j}\binom{n-X}{k-j}$$
I'm looking for elegant proofs of these alternative forms. Preferably in an elementary way or using the generating series (see again Wikipedia)
$$\sum_{k=0}^\infty K_k Z^k = (1 + (q-1)Z)^{n-X} (1-Z)^X$$ where polynomial exponents are defined based on the binomial series $$(1 + Z)^X = \sum_{i=0}^\infty \binom{X}{i} Z^i.$$
Comment
The alternative expressions have also been mentioned (without proof) here as well as here (for $q=2$).