A new proof of the rhodes type II conjecture

For a given finite monoid M we explicitly construct a finite group G and a relational morphism tau : M --> G such that only elements of the type II construct M-c relate to 1 under tau. This provides an elementary and constructive proof of the type II conjecture of John Rhodes. The underlying idea is also used to modify the proof of Ash's celebrated theorem on inevitable graphs. For any finite monoid M and any finite graph F a finite group G is constructed which "spoils" all labelings of Gamma over M which are not inevitable.