## Discussion Forum

Que. | Given the recursively enumerable language (LRE), the context sensitive language (LCS) the recursive language (LREC) the context free language (LCF) and deterministic context free language (LDCF) The relationship between these families is given by |

a. | LCF ⊆ LDCF ⊆ LCS ⊆ LRE ⊆ LREC |

b. | LCF ⊆ LDCF ⊆ LCS ⊆ LREC ⊆ LRE |

c. | LDCF ⊆ LCF ⊆ LCS ⊆ LRE ⊆ LREC |

d. | LDCF ⊆ LCF ⊆ LCS ⊆ LREC ⊆ LRE |

Answer:LCF ⊆ LDCF ⊆ LCS ⊆ LREC ⊆ LRE |