We define f: as a computable function if some Turing machine M, on every input w, halts with just f(w) on its tape. Also, a language A is mapping reducible to language B, written AmB, if there is a computable function ("coding") f:, where for every w, wAf(w)B f is called a reduction from A to B. Construct such an f in a way a non-expert can easily understand. Provide an example (preferably your own) for extra credit (4 pts)