With the aid of an illustration define the following terms as applied in database:                                                                                   i.            Cardinality                              ii.            Degree                            iii.              Tuple

i. Cardinality: In the context of databases, cardinality refers to the uniqueness of data values contained in a particular column (attribute) of a database table. The lower the cardinality, the more duplicated elements in a column. Therefore, a column with the lowest possible cardinality would have the same value for every row. High cardinality column values are typically unique or almost unique, and can be used as a primary key.

Illustration: Consider a database of a library. The 'Books' table may have a 'Genre' column. Since there are a limited number of genres, the cardinality of this column would be low. On the other hand, the 'BookID' column would have unique values for each book, hence it would have high cardinality.

ii. Degree: The degree of a relation is the number of attributes it contains. The degree is also known as the arity. For example, a relation with two attributes is called a binary or 2-ary relation; a relation with three attributes is called a ternary or 3-ary relation, and so on.

Illustration: In a 'Students' table, if we have three columns 'StudentID', 'StudentName', and 'Course', then the degree of the relation (table) is 3.

iii. Tuple: A tuple in a database is a row of a table. It contains information about a specific item in a database. Each attribute of the table is populated to represent a specific piece of data about the item.

Illustration: In a 'Students' table, a tuple could be ('S001', 'John Doe', 'Computer Science'), where 'S001' is the StudentID, 'John Doe' is the StudentName, and 'Computer Science' is the Course.