give justification also SOS

For W E (0+1). let diw) denote the decimal value of w for exampled(101)=5. Let there be a language L, such that: L={W (0+1)-1d(s) mod 5= 2 and dis) mod 7+4) Which of the following statements are true and which of them are false? Justify the answers. a) L is recursively enumerable, but not recursive b) Lis recursively enumerable but not context free c) Lis recursive but not context free d) Lis context free but not regular e) L is regular