The question I am trying to solve is below. I have proven it is an order but am unsure how to draw the diagram for it. Can someone point me in the right direction?
Let A = {1, 2, 3, 4}, and let R be a binary relation on A × A given by: ((a, b),(c, d)) ∈ R if and only if a divides c and b divides d.
What I have so far, on the right track?
second level: (1,2)(1,3)(1,4)(2,1)(2,2)(2,3)(2,4)(3,1)(3,2)(3,3)(3,4)(4,1)(4,2)(4,3)(4,4)
bottom level: (1,1)