Answer Happy

Please do not copy-paste the wrong answer.
6 (25) Show work pages that follow, properly numberd, and record only the answers on this page. Define the sequence of sets: (SIN EN) recursively as follows: Base case: (BC) S, = 0 Recursive step:(RCS) Vn E --((-)W 1 (1) Compute: S. = 1 (ii) ( Compute: v(S) = 1 1 (iii) Compute: S2 1 (iv) Compute: v(S) = 1 (v) Formulate a conjecture for the value of v(S.)in terms of n. v(s) 1 (vi) Verify your conjecture on the facing side for: n = 3.