Theory of computation Mapping reductions

(3 points) Answer True or False. (a) Mapping reduction is a transitive relation. In other words, for all languages A, B, C over , (b) Napping reduction is a synmetrie relation. In other words, for all languages A and over (c) Mapping reduction is a reflexive relation. In other words, for every language A over , if A Sm B and B C then A Sm C. , if A m, B then B 'n A. A Km A apping reduction is a symmetric relation. In other words, or all languages A and B