need help with #3

Write out truth tables representing the following truth functions: The three-place function which takes the value T just in case (j.i.c.) exactly one of its arguments or sentential inputs takes the value T The three-place function which takes the value T j.i.c. at least two of its arguments take the value T. The three-place function that takes the value F j.i.c. its second argument takes the value T. The three-place function that takes the value F j.i.c its first argument is T and the second and third arguments have opposite truth values. For each of the truth functions specified above, find a formula in SL (using the standard operators) that expresses it. How many total three-place truth functions are there? (Though you don't need to list them all, it would be nice for you to give some sense of how you arrived at your answer.)