An interpreter for a language L maps programs written in L to their answers. Remember that a language is a set of words. Let us define our language Ladd-mods inductively as follows: 1. The words 0, 1, and 2 are in Ladd-mod 2. Assume that both A and B stand for words in the language Ladd-mods. Then (a) (A+B) are also in Ladd-mods