Relations, are stored as (A,R) where A is the vertex set and R is a set where elements are pairs (a,b) which encodes the edge from a to b. ## For this one it is possible to go over 30 points, up to...

Relations, are stored as (A,R) where A is the vertex set and R is a set where elements are pairs (a,b) which encodes the edge from a to b. ## For this one it is possible to go over 30 points, up to 50, to cover up any other prograaming homeworks where you didn't get full credit. ## We want to create a checker that checks the 4 properties. (15 points out of 30) ## We want to create a function that creates the transtivie closure of R, by computing the powers of R (15 points of out 30) ## (Bonus) we want to create a function that only takes the covering edges of a partial order. (20 points) ## Throughout this process, you are not allowed to use any pre-created functions involving digraphs, posets, etc. All algorithms, except for basic things like set union,divisors,subsets functions, must be created by you. You will get 0 credit if you do not follow this.