) Let A be mapping reducible to B (A ≤m B). Which of the following are true (circle them). a) If B is a regular language

[answerhappygod]

) Let A be mapping reducible to B (A ≤m B). Which of the
following are true (circle them).
a) If B is a regular language, then A is Turing
recognizable.
b) If B is also mapping reducible to A, then both A and B are
Turing recognizable.
c) If A is decidable, then B is also decidable.
d) If A is also mapping reducible to B and B is Turing
recognizable, then A is decidable