S1 : If a language is turing recognizable, then it must either say "YES" and loop forever instead of saying "NO" and vice versa. A TM can fail to halt iff input is infinite, if it is finite then utilmately it will stop and the language will become turing decidable and not turing recognizable(as TM will say "YES" when it accepts the lang and eventually it will say "NO" when it reaches the end of the string ). If the input is finite there is no scope for looping forever. So S1 is true.
S2 : TMs that doesnot accept w, so the machine accepts w, we can rightway say "NO" and halt and if it doen't accept w and goes to some dead state, then we can rightway say that "YES" TM doesn't accept w. So , this is turing decidable. So, S2 is False.