You are given an array of N numbers and a number K. Find the minimum number of swaps required to bring all the numbers greater than or equal to K together.

**Note:** Swap here means, swapping value of array[i] and array[j], where 1 <= i, j <= N

```
Example:
Input:
N = 5, k = 3
arr[] = 5, 2, 1, 3, 4
Output: 1
Explanation: We need to bring 5,3 and 4 together. So swap 5 and 1.
```

Can someone tell me the right approach to proceed this question?