Final answer:
K bits in a sequence yield 2^K symbols, with each bit having 2 possible states.
Step-by-step explanation:
To determine how many symbols can be represented by K bits in a sequence, we use the fact that each bit can represent two states (0 or 1). Therefore, if you have K bits, each bit has 2 possibilities. The number of unique symbols or different combinations you can create with K bits is found by calculating 2 raised to the power of K (2^K).
- For 1 bit, you have 2 possible symbols (0 or 1).
- For 2 bits, you have 2^2 = 4 possible symbols (00, 01, 10, 11).
- For K bits, you have 2^K possible symbols.
So the answer to how many symbols K bits in a sequence yield is b. 2^K.