Define a context-free grammar (CFG) for the language L={0^m1^n ∣2n≥m≥n≥0}

I’ve been trying to solve the following exercise:
define a context-free grammar (CFG) for the language: