Question 1. Let be a recursively defined language over the alphabet = {0, 1} as follows. Basis case: EEL, where e denotes the empty string. Recursive step: if sЄL then: f(n) = (Os0 € L 1s1 EL a) Show the steps to construct the string 010010 starting from the base case and repeatedly applying the recursive step. b) List all non-empty strings of length four or less symbols (hint: there are six strings). c) Use structural induction to show that the length of every string in L is even. That is, let x be a string and let P(x) denote that || is even. Show that Vr Є L, P(x)