The number of all possible matrices of order \(2 \times 3\) with each entry 0 or 1 is
Answer & explanation
Correct answer: option 4
The correct answer is Option (4) → 64
A \(2 \times 3\) matrix has \(2 \times 3 = 6\) entries.
Each entry can be filled in 2 ways (0 or 1), independently of the others, so by the multiplication principle:
\(\text{Number of matrices} = 2^6 = 64\)