(I). Finite automaton accept all string which are in language and reject those strings which are not in language so it is decidable
(ii). CFL may or may not be regular so it undecidable
(iii). Behaviour of TM is not given so it is also undecidable
Hence 4. (ii) &(iii ) is undecidable