Write the following relations in Haskell

Consider a universe discourse u = {1,2,3,4,5,6,7,8}

type Reln = [(Int,Int)]

1.) Reflexive Relation / forall a, (a,a) in R

reflexRelation :: Reln -> Bool

reflexRelaion r =

2.) Symmetric Relation / forall a b, (a,b) in R -> (b,a) in R

symmRelation:: Reln -> Bool

symmRelation s =

3.) Transitive Relation / forall a b c, ((a,b) in R /\ (b,c) in R) -> (a,c) in R

transRelation :: Reln -> Bool

transRelation t =