Consider the following C function definition

int Trial (int a, int b, int c)
{
       if ((a > = b) && (c < b)) return b;
       else if (a > = b) return Trial (a,c,b);
       else return Trial (b,a,c);
}

The function Trial:

Consider the regular expression $$(0+1)(0+1).......n$$ times. The minimum state finite automation that recognizes the language represented by this regular expression contains:

Let $${L_D}$$ be the set of all languages accepted by a $$PDA$$ by final state and $${L_E}$$ the set of all languages accepted by empty stack. Which of the following is true?

Context free languages are closed under: