ONLY PARTS 3-4 PLEASE

1. (12 points) Consider a set S of n elements, {01, 02, 03, ..., an}. P(S), the power set of S, is the set of all subsets of S. Note that we can find all the subsets of S recursively. To understand the algorithm, first observe that given any element in S, the subsets of S can be divided evenly into those that contain that element and those that do not. For example, consider the element Rowlet from the set Torchic, Rowlet, Piplup}. There are 4 subsets that contain Rowlet: {Rowlet}, {Torchic, Rowlet}, {Rowlet, Piplup}, {Torchic, Rowlet, Piplup}. And there are 4 subsets that don't contain Rowlet: {}, {Torchic}, {Piplup}, {Torchic, Piplup}. We can approach the problem of finding all subsets of {Torchic, Rowlet, Piplup} like this: First, remove Rowlet and find all subsets of {Torchic, Piplup}: {}, {Torchic}, {Piplup}, {Torchic, Piplup} Now, make a copy of those subsets, and insert Rowlet into each of them: