2. Let D be a relation on the natural numbers N defined by D =
{(m,n) : m | n} (i.e., D(m,n) is true when n is divisible by m. For
this problem, you’ll be proving that D is a partial order. This
means that you’ll need to prove that it is reflexive,
anti-symmetric, and transitive.
(a) Prove that D is reflexive. (Yes, you already did this problem
on one of the minihomework assignments. You don’t have to redo the...