8. The function f: (binary strings) binary strings). In each case, find f(S). a. S-(000, 1011, 10001), f(x)-the second bit in x b. S = {1 1 1, 100, 01 1 1 }, f(x) = the binary string that is the sum of the first and last bit c. S [001, 11, 101), f(x)- the binary string that is equal to x+ 1