Which type of automaton is capable of recognizing context-sensitive languages?

In the Chomsky Hierarchy, which language class is known for its linear-bounded automaton equivalence?a.Regular languagesb.Context-sensitive languagesc.Recursively enumerable languagesd.Context-free languages

The equivalence between Linear Bounded Automata (LBA) and Context-Sensitive Languages is established by:a.Sipser's Theoremb.LBA-CSL Equivalencec.CSL-LBA Equivalenced.Pumping Lemma for CSL

Let Σ = {0, 1} and let B be the collection of strings that contain at least one 1 in their second half. In other words,B = {uv|u ∈ Σ∗, v ∈ Σ∗1Σ∗ and |u| ≥ |v|}(a) Give a Push-Down Automata (PDA) that recognises B.(b) Give a Context-Free Grammar (CFG) that recognise

Recursive languages are a subset of:a.Recursively enumerable languagesb.Context-sensitive languagesc.Context-free languagesd.Regular languages

Let Σ = {0, 1} and let B be the collection of strings that contain at least one 1 in their second half. In other words,B = {uv|u ∈ Σ∗, v ∈ Σ∗1Σ∗ and |u| ≥ |v|}(a) Give a Push-Down Automata (PDA) that recognises B.(b) Give a Context-Free Grammar (CFG) that recognises B.