Define a well-ordering relation R on the set of rationals:

So using the definition of well-ordering from wikipedia, "awell-orderrelation on a setSis a total order onSwith the property that every non-empty subset ofShas a least element in this ordering"

In other words we need to ensure that the relation is transitive, antisymmetric and total and that every non empty subset of S has a least element.

I am stuck on how to define such a relation... any help would be appreciated!