2. Assume the following mathematical fact called the Well-ordering Property (WOP): Every nonempty set of natural numbers has a smallest element (that is, if E is a nonempty set of natural numbers, then there is some number m E E such that m S n for all numbers n E E). Use the wellordering property to carefully prove that every innite subset of the natural numbers is denumerable (i.e. countably innite)