Respuesta :

Using the Fundamental Counting Theorem, it is found that it could issue 6,760,000 plates.

Fundamental counting theorem:

States that if there are n things, each with [tex]n_1, n_2, …, n_n[/tex] ways to be done, each thing independent of the other, the number of ways they can be done is:

[tex]N = n_1 \times n_2 \times \cdots \times n_n[/tex]

In this problem:

  • Two letters, for each there are 26 outcomes, hence [tex]n_1 = n_2 = 26[/tex]
  • Four digits, for each there are 10 outcomes, hence [tex]n_3 = n_4 = n_5 = n_6 = 10[/tex]

Then, applying the theorem:

[tex]N = 26^2 \times 10^4 = 6760000[/tex]

It could issue 6,760,000 plates.

A similar problem is given at https://brainly.com/question/19022577