Multiple choice If A = {0, 1}, then the number of possible strings of length 'n' is n! nxn nn 2n Reveal answer Fill a bubble to check yourself D Correct answer Explanation For an alphabet of size 2 (0 and 1) and strings of length n, each position has 2 choices. Thus, there are 2 * 2 * ... * 2 (n times) = 2^n possible strings.