Assume an error correcting algorithm is capable of correcting at most $3$ errors in the corrupted codewords. What should be the minimum distance among the valid codewords?

a$.4$

b$.5$

c$.6$

d$.7$