Explain the implementation of a Michael-Scott lock-free queue (MS-queue) in Rust or C++. Detail the memory ordering constraints (e.g., acquire, release, sequentially consistent) required for the pointer operations (head and tail) to ensure thread safety without mutexes. Discuss the ABA problem and how your implementation prevents it, providing code snippets for the compare-and-swap (CAS) loops.