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 {111. 100, 0111}, 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

b. x- 48 =120

step-by-step explanation:

no association

step-by-step explanation:

if you have eyes and you can use them efficiently you can see that it just looks like random dots like do a line of best fit and like they're so spread out it's such a weak association you might as well consider it nonexistent

47 - 90 = 43

43 - 180 = x

x = 137