Gfor n ∈ z≥1, consider the sets en = {binary sequences of length n with an even number of 1’s} in = {binary sequences of length n with an odd number of 1’s} (a) show that |en| = |on| by matching up elements of en with elements of on. (b) show that |e1|, |e2|, . . is a recursive sequence, and give a counting argument for the recursion

This chapter lists many ways in which becoming computer literate is beneficial. think about what your life will be like once you’re started in your career. what areas of computing will be most important for you to understand? how would an understanding of computer hardware and software you in working from home, working with groups in other countries and contributing your talents.