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 ________.

A circular sheet of paper is folded along the lines in the directions shown. The paper, after being punched in the filial folded state as shown and unfolded in the reverse order of folding, will look like _________.