You are given K number of coins with equal weights and a mechanical balance scale that can show if the pans (and their loads) are balanced or not. The problem is posed as finding the single different coin in the collection, which was mixed up accidentally. Devise the quickest algorithm, which can find the different coin. Generalize your solution for any K. Show the recurrence relation, time and space complexity.