Assume you are using a binary code error correcting code $C$. If the minimum Hamming distance between any two codewords of $C$ is $3$. Then
- We can correct and detect $2$ bit errors.
- We can correct $1$ bit errors and detect $2$ bit errors.
- We can correct $2$ bit errors and detect $1$ bit errors.
- We can correct $1$ bit errors and detect $1$ bit errors.
- None of the above.