The number of states required by a Finite State Machine, to simulate the behaviour of a computer with a memory capable of storing ‘m’ words, with each word being ‘n’ bits long is

A

$$m \times 2^n$$

B

$$2^{m + n}$$

C

$$2^{mn}$$

D

$$m + n$$