Implement more advanced algorithm of moving participants from queues to rooms

[Velnbur]

Situtation

In the current implementation of the Coin Shuffle process, when there is more or an equal number of participants in the waiting queue than the configurable one, the service empties the queue, creates a room with that participants, and starts shuffling. Which has lots of pros and cons.

Cons of current implementation:

• The size of rooms could be easily defined, that's why the attacker could start participating with different UTXOs in the same room to deanonymize the left participant in the room.

Objective

Implement a more advanced algorithm for distributing participants from the queue to rooms.

Consideration

One of the ideas was, when the minimum number of participants has connected, start waiting some time to prevent