Answer:
A total of three D flip-flops are required to store the count sequence A, B, C. Option (c) is true.
Step-by-step explanation:
The explanation is based on the fact that each flip-flop in the counter design represents one bit of the count sequence.
In this scenario, the count sequence is represented by A, B, and C, where A is the most significant bit (MSB) and C is the least significant bit (LSB).
A flip-flop for A: One flip-flop is needed to store the state of bit A.
A flip-flop for B: Another flip-flop is needed to store the state of bit B.
A flip-flop for C: Yet another flip-flop is needed to store the state of bit C.
The concept used here is that each bit in a binary count sequence requires one flip-flop to store its state.
This is based on the binary nature of counting, where each bit represents a power of 2 (1, 2, 4, 8, etc.).
So, a total of three D flip-flops are required to store the count sequence A, B, C.
Thus, Option (c) is true.