Given the matrix representing a relation on a finite set, determine whether the relation is reflexive or irreflexive.. Need your help!

Given the matrix representing a relation on a finite set, determine whether the relation is reflexive or irreflexive.. Need your help!

A reflexive relation is one in which every element is related to itself.
so all you need to do (assuming the relation has only numbers) is to make sure that the matrix has ordered pairs like (1,1),(2,2) and so on for all elements in the set.
if you still cant solve it, reply and i ll post the code

cN u post the code pls?...It's not for me, It's for my friend. pls help and thanks

PM me the entire question pls....i ll post the answer

PM me the entire question pls....i ll post the answer

Given the matrix representing a relation on a finite set, determine whether the relation is reflexive or irreflexive.. Need your help!

"A user has to input matrix coordinates and then the computer will tell if the matrix is REFLEXIVE or IRREFLEXIVE (the computer will also ask for the number of rows and columns)"