A bitwise operation 'f' has an interesting characteristic, such that, if f(a,b) = c, it always turns out to be the case that f(b,a) = c; f(a,c) = b; f(c,a) = b; f(b,c) = a; f(c,b) = c. Which of these functions could 'f' possibly be? code example

Example: Write a JAVA method that expands a given binomial (ax + by)n, where integers a, b, n are user inputs. For example, if a = 2, b = -12, n = 4 are entered the method should print or return

Write a JAVA method that expands a given binomial (ax + by)n, where integers a, b, n are user inputs.  For example, if a = 2, b = -12, n = 4 are entered the method should print or return