$9.$ 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$