$($a$)$ Prove that in an $($n$,$k$,$d$)-$code C over a field F$,$ d ~ n $-$ k $+1.$ This is known as the

Singleton bound.

$($b$)$ Prove that an $($n$,$k$)-$code C capable of correcting t errors must have at least $2$t check

symbols