Answer True or False for the following questions.

$(5)$ If a language L is decidable then it must be the case that both L and L are recognizable.

$(6)$ If L is undecidable then it must be the case that exactly one of L or L is not recognizable.

$(7)$ If both A and B are NP$-$complete, then we have both A $<=$P B and B $<=$P A$.$

$(8)$ TIME$($t$($n$))$ defined using single$-$tape DTMs is the same as using multi$-$tape DTMs$.$

$(9)$ The class P defined using single$-$tape DTMs is the same as using multi$-$tape DTMs$.$