B={aibjcj0i>j} Show that B can be written as the intersection of two context-free languages to provide a counter-example to the idea that CFLs are closed under intersection. (NB: You are expected to present a CFG / PDA for each language to make the case that it is a CFL - approximately 20% of the marks are allocated to identifying 2 languages whose intersection is B and the remaining 80% to establishing that they are indeed CFLs)..