Let S = {a, b, c} and T = {1, 2, 3}. Find F^–1 of the following functions F from S to T, if it exists.

F = {(a, 3), (b, 2), (c, 1)}

Given a non-empty set X, consider the binary operation ∗: P(X) × P(X) → P(X) given by A ∗ B = A ∩ B ∀ A, B in P(X), where P(X) is the power set of X. Show that X is the identity element for this operation and X is the only invertible element in P(X) with respect to the operation ∗.

Find the number of all onto functions from the set {1, 2, 3, ..., n} to itself.

Let S = {a, b, c} and T = {1, 2, 3}. Find F^–1 of the following functions F from S to T, if it exists.

F = {(a, 2), (b, 1), (c, 1)}

Consider the binary operations ∗: R × R → R and o: R × R → R defined as a ∗b = |a – b| and a o b = a, ∀ a, b ∈ R. Show that ∗ is commutative but not associative, o is associative but not commutative. Further, show that ∀a, b, c ∈ R, a ∗ (b o c) = (a ∗ b) o (a ∗ c). [If it is so, we say that the operation ∗ distributes over the operation o]. Does o distribute over ∗? Justify your answer.