the answer cis right .
4th statement if a->b in polynomial time means that b complexity can't be higher than a . so if b is undecidable a will be anything lower than undecidable , so it may be decidable .
and for 2 take example . a^p where p is prime and sigma * which is regular , and now pull out intersection .
