Discrete structures please solve

3. ( 6 marks) Consider a relation R on the set A={1,2,3,4,5,6} given through its matrix representation: MR=3210000002110000200100041101005111000101011 a) What is the minimal partial ordering R that contains R ? In other words, what pairs need to be added to R in order to obtain a partial ordering R ? b) Draw the Hasse diagram of R. c) What are the upper bounds of {1,3}, if any such upper bound exist? d) What is the greatest lower bound of {5,6}, if it exists? (2)R={(2,1),(2,3),(3,2),(2,),(4,1),(4,2)}(5,1),(5,2),(5,3),(5,5)2,(6,2),(,3),(6,5)} (c) it does not exist (d) it does not exist