Let Σ = {a, b, c, d, e}. Find a non-context-free language A on Σ where all symbols appear at least in one of the strings in A and a non-regular language context-free language B such that A ∪ B is context-free. Prove that A is non-context-free, B is context-free and A ∪ B is context-free.