The binary relation R = {(1, 1)}, (2, 1), (2, 2), (2, 3), (2, 4), (3, 1), (3, 2), (3, 3), (3, 4) } on the set A = { 1, 2, 3, 4} is

Let (A, *) be a semigroup. Furthermore, for every a and b in A, if $$a\, \ne \,b$$, then $$a\,*\,b \ne \,\,b\,*\,a$$.

(a) Show that for every a in A
a * a = a
(b) Show that for every a, b in A
a * b * a = a
(c) Show that for every a, b, c in A
a * b * c = a * c

Suppose A = {a, b, c, d} and $${\Pi _1}$$ is the following partition of A

$${\Pi _1}\, = \,\{ \{ a,\,\,b,\,\,c\,\} \,,\,\{ d\} \,\} $$
(a) List the ordered pairs of the equivalence relations induced by $${\Pi _1}$$
(b) Draw the graph of the above equivalence relation.

The number of functions from an $$m$$ element set to an $$n$$ element set is