C program for doing some set

1. Write a C program that Inputs a set A with m elements. Inputs a set B with n elements. Inputs a binary relation R C A x B. Checks whether A is a valid set. (A set cannot contain an element more than once.) Checks whether B is a valid set. Checks whether R is a valid relation. Outputs whether R is reflexive. Outputs whether R is symmetric. Outputs whether R is transitive. Outputs whether R is antisymmetric. Outputs whether R is an equivalence relation. Outputs whether R is a partial order. Outputs whether R is a function. For simplicity, the elements of the underlying set A can be limited to the selected ASCII characters: a, b, c, d, e, f, g, h, j, i, k, l, m, n, o, p, r, s, t, u, v, w, x, y, z, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, &, ?.