Consider the following language.

L = { w ∈ {0, 1}* | w ends with the substring 011}

Which one of the following deterministic finite automata accepts L?

Let $$\left\langle M \right\rangle $$ denote an encoding of an automation M. Suppose that ∑ = {0, 1}. Which of the following languages is/are NOT recursive?

Given below are two statements I and II and two conclusions I and II :

Statement :

I. All bacteria are microorganisms.

II. All pathogens are microorganisms.

Conclusions :

I. Some pathogens are bacteria.

II. All pathogens are not bacteria

Based on the above statements and conclusions, which one of the following options is logically CORRECT?

There are five bags each containing identical sets of ten distinct chocolates. One chocolate is picked from each bag.

The probability that at least two chocolates are identical is ________.