Chang's lemma via Pinsker's inequality

Extending the idea in [Impagliazzo, R., Moore, C. and Russell, A., An entropic proof of Chang's inequality. SIAM Journal on Discrete Mathematics, 28(1), pp.173-176.] we give a short information theoretic proof for Chang's lemma that is based on Pinsker's inequality.